./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.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/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:39:18,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:39:19,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:39:19,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:39:19,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:39:19,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:39:19,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:39:19,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:39:19,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:39:19,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:39:19,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:39:19,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:39:19,065 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:39:19,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:39:19,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:39:19,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:39:19,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:39:19,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:39:19,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:39:19,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:39:19,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:39:19,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:39:19,068 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:39:19,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:39:19,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:39:19,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:39:19,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:39:19,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:39:19,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:39:19,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:39:19,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:39:19,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:19,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:39:19,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:39:19,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:39:19,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:39:19,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:39:19,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:39:19,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:39:19,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:39:19,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:39:19,072 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2024-11-10 14:39:19,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:39:19,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:39:19,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:39:19,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:39:19,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:39:19,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2024-11-10 14:39:20,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:39:20,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:39:20,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2024-11-10 14:39:20,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2315dd6f0/f70c202ebbe5468092b64340deb7fe3b/FLAGc0dff2345 [2024-11-10 14:39:21,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2315dd6f0/f70c202ebbe5468092b64340deb7fe3b [2024-11-10 14:39:21,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:39:21,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:39:21,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:21,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:39:21,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:39:21,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7f9ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21, skipping insertion in model container [2024-11-10 14:39:21,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:39:21,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:21,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:39:21,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:21,475 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:39:21,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21 WrapperNode [2024-11-10 14:39:21,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:21,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:21,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:39:21,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:39:21,482 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:39:21" (1/1) ... [2024-11-10 14:39:21,496 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:39:21" (1/1) ... [2024-11-10 14:39:21,528 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 363 [2024-11-10 14:39:21,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:21,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:39:21,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:39:21,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:39:21,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:39:21,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:39:21,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:39:21,589 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:39:21,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (1/1) ... [2024-11-10 14:39:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:21,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:39:21,633 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:39:21,636 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:39:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:39:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:39:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:39:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:39:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:39:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:39:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:39:21,686 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:39:21,789 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:39:21,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:39:22,334 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:39:22,334 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:39:22,361 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:39:22,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:39:22,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:22 BoogieIcfgContainer [2024-11-10 14:39:22,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:39:22,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:39:22,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:39:22,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:39:22,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:39:21" (1/3) ... [2024-11-10 14:39:22,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c84aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:22, skipping insertion in model container [2024-11-10 14:39:22,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:21" (2/3) ... [2024-11-10 14:39:22,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c84aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:22, skipping insertion in model container [2024-11-10 14:39:22,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:22" (3/3) ... [2024-11-10 14:39:22,372 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2024-11-10 14:39:22,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:39:22,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 14:39:22,392 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:39:22,529 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:39:22,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 485 places, 504 transitions, 1029 flow [2024-11-10 14:39:22,781 INFO L124 PetriNetUnfolderBase]: 29/501 cut-off events. [2024-11-10 14:39:22,781 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:39:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 501 events. 29/501 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1046 event pairs, 0 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 384. Up to 2 conditions per place. [2024-11-10 14:39:22,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 485 places, 504 transitions, 1029 flow [2024-11-10 14:39:22,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 466 places, 484 transitions, 986 flow [2024-11-10 14:39:22,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:39:22,817 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;@3882b947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:39:22,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-10 14:39:22,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:39:22,825 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-10 14:39:22,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:39:22,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:22,826 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] [2024-11-10 14:39:22,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:22,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1678394006, now seen corresponding path program 1 times [2024-11-10 14:39:22,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:22,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213374218] [2024-11-10 14:39:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:23,013 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:39:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213374218] [2024-11-10 14:39:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213374218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472870691] [2024-11-10 14:39:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:23,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:23,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 504 [2024-11-10 14:39:23,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 484 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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:39:23,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:23,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 504 [2024-11-10 14:39:23,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:23,414 INFO L124 PetriNetUnfolderBase]: 36/1191 cut-off events. [2024-11-10 14:39:23,415 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-10 14:39:23,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1191 events. 36/1191 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5526 event pairs, 20 based on Foata normal form. 103/1154 useless extension candidates. Maximal degree in co-relation 979. Up to 58 conditions per place. [2024-11-10 14:39:23,436 INFO L140 encePairwiseOnDemand]: 479/504 looper letters, 15 selfloop transitions, 2 changer transitions 5/461 dead transitions. [2024-11-10 14:39:23,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 461 transitions, 974 flow [2024-11-10 14:39:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1423 transitions. [2024-11-10 14:39:23,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411375661375662 [2024-11-10 14:39:23,459 INFO L175 Difference]: Start difference. First operand has 466 places, 484 transitions, 986 flow. Second operand 3 states and 1423 transitions. [2024-11-10 14:39:23,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 461 transitions, 974 flow [2024-11-10 14:39:23,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 461 transitions, 962 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:39:23,473 INFO L231 Difference]: Finished difference. Result has 461 places, 456 transitions, 922 flow [2024-11-10 14:39:23,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=461, PETRI_TRANSITIONS=456} [2024-11-10 14:39:23,481 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -5 predicate places. [2024-11-10 14:39:23,482 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 456 transitions, 922 flow [2024-11-10 14:39:23,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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:39:23,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:23,483 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] [2024-11-10 14:39:23,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:39:23,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -585100339, now seen corresponding path program 1 times [2024-11-10 14:39:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769238094] [2024-11-10 14:39:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:23,535 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:39:23,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:23,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769238094] [2024-11-10 14:39:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769238094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:23,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500127314] [2024-11-10 14:39:23,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:23,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:23,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 504 [2024-11-10 14:39:23,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 456 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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:39:23,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:23,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 504 [2024-11-10 14:39:23,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:23,780 INFO L124 PetriNetUnfolderBase]: 39/1141 cut-off events. [2024-11-10 14:39:23,781 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:39:23,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 1141 events. 39/1141 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4999 event pairs, 23 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1189. Up to 66 conditions per place. [2024-11-10 14:39:23,798 INFO L140 encePairwiseOnDemand]: 501/504 looper letters, 16 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2024-11-10 14:39:23,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 455 transitions, 956 flow [2024-11-10 14:39:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1399 transitions. [2024-11-10 14:39:23,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252645502645502 [2024-11-10 14:39:23,801 INFO L175 Difference]: Start difference. First operand has 461 places, 456 transitions, 922 flow. Second operand 3 states and 1399 transitions. [2024-11-10 14:39:23,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 455 transitions, 956 flow [2024-11-10 14:39:23,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 455 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:23,856 INFO L231 Difference]: Finished difference. Result has 455 places, 455 transitions, 920 flow [2024-11-10 14:39:23,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=455, PETRI_TRANSITIONS=455} [2024-11-10 14:39:23,858 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -11 predicate places. [2024-11-10 14:39:23,858 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 455 transitions, 920 flow [2024-11-10 14:39:23,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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:39:23,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:23,860 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:23,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:39:23,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1705497138, now seen corresponding path program 1 times [2024-11-10 14:39:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979194720] [2024-11-10 14:39:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:23,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:39:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:23,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979194720] [2024-11-10 14:39:23,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979194720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:23,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:23,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327271804] [2024-11-10 14:39:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:23,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:23,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 504 [2024-11-10 14:39:23,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 455 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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:39:23,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:23,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 504 [2024-11-10 14:39:23,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:24,133 INFO L124 PetriNetUnfolderBase]: 68/1412 cut-off events. [2024-11-10 14:39:24,133 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:39:24,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1412 events. 68/1412 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7421 event pairs, 45 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 1500. Up to 111 conditions per place. [2024-11-10 14:39:24,146 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 18 selfloop transitions, 1 changer transitions 0/450 dead transitions. [2024-11-10 14:39:24,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 948 flow [2024-11-10 14:39:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2024-11-10 14:39:24,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9206349206349206 [2024-11-10 14:39:24,149 INFO L175 Difference]: Start difference. First operand has 455 places, 455 transitions, 920 flow. Second operand 3 states and 1392 transitions. [2024-11-10 14:39:24,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 948 flow [2024-11-10 14:39:24,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:24,154 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 908 flow [2024-11-10 14:39:24,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-11-10 14:39:24,156 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -16 predicate places. [2024-11-10 14:39:24,156 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 908 flow [2024-11-10 14:39:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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:39:24,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:24,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:24,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:39:24,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1806633571, now seen corresponding path program 1 times [2024-11-10 14:39:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857112238] [2024-11-10 14:39:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:24,228 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:39:24,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857112238] [2024-11-10 14:39:24,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857112238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:24,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:24,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138797630] [2024-11-10 14:39:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:24,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:24,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 504 [2024-11-10 14:39:24,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:24,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:24,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 504 [2024-11-10 14:39:24,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:24,472 INFO L124 PetriNetUnfolderBase]: 58/1296 cut-off events. [2024-11-10 14:39:24,473 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-10 14:39:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1296 events. 58/1296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6647 event pairs, 38 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 1364. Up to 93 conditions per place. [2024-11-10 14:39:24,490 INFO L140 encePairwiseOnDemand]: 501/504 looper letters, 14 selfloop transitions, 2 changer transitions 0/449 dead transitions. [2024-11-10 14:39:24,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 449 transitions, 938 flow [2024-11-10 14:39:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1403 transitions. [2024-11-10 14:39:24,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9279100529100529 [2024-11-10 14:39:24,493 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 908 flow. Second operand 3 states and 1403 transitions. [2024-11-10 14:39:24,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 449 transitions, 938 flow [2024-11-10 14:39:24,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 449 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:24,500 INFO L231 Difference]: Finished difference. Result has 450 places, 449 transitions, 909 flow [2024-11-10 14:39:24,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=909, PETRI_PLACES=450, PETRI_TRANSITIONS=449} [2024-11-10 14:39:24,502 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -16 predicate places. [2024-11-10 14:39:24,502 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 449 transitions, 909 flow [2024-11-10 14:39:24,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:24,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:24,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:24,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:39:24,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:24,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash -780588119, now seen corresponding path program 1 times [2024-11-10 14:39:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143401156] [2024-11-10 14:39:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:24,990 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:39:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143401156] [2024-11-10 14:39:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143401156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229490487] [2024-11-10 14:39:24,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:25,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 504 [2024-11-10 14:39:25,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 449 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 0 states have call successors, (0), 0 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:39:25,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:25,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 504 [2024-11-10 14:39:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:27,413 INFO L124 PetriNetUnfolderBase]: 2314/17707 cut-off events. [2024-11-10 14:39:27,414 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-11-10 14:39:27,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21252 conditions, 17707 events. 2314/17707 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 216100 event pairs, 1879 based on Foata normal form. 0/15702 useless extension candidates. Maximal degree in co-relation 21214. Up to 3430 conditions per place. [2024-11-10 14:39:27,543 INFO L140 encePairwiseOnDemand]: 492/504 looper letters, 48 selfloop transitions, 10 changer transitions 0/447 dead transitions. [2024-11-10 14:39:27,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 447 transitions, 1021 flow [2024-11-10 14:39:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2580 transitions. [2024-11-10 14:39:27,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8531746031746031 [2024-11-10 14:39:27,548 INFO L175 Difference]: Start difference. First operand has 450 places, 449 transitions, 909 flow. Second operand 6 states and 2580 transitions. [2024-11-10 14:39:27,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 447 transitions, 1021 flow [2024-11-10 14:39:27,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 447 transitions, 1017 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:27,554 INFO L231 Difference]: Finished difference. Result has 451 places, 447 transitions, 921 flow [2024-11-10 14:39:27,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=921, PETRI_PLACES=451, PETRI_TRANSITIONS=447} [2024-11-10 14:39:27,555 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -15 predicate places. [2024-11-10 14:39:27,556 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 447 transitions, 921 flow [2024-11-10 14:39:27,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 421.5) internal successors, (2529), 6 states have internal predecessors, (2529), 0 states have call successors, (0), 0 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:39:27,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:27,557 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] [2024-11-10 14:39:27,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:39:27,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -325110386, now seen corresponding path program 1 times [2024-11-10 14:39:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403545126] [2024-11-10 14:39:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:27,610 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:39:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403545126] [2024-11-10 14:39:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403545126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:27,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:27,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228269519] [2024-11-10 14:39:27,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:27,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:27,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 504 [2024-11-10 14:39:27,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 447 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:27,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:27,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 504 [2024-11-10 14:39:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:27,831 INFO L124 PetriNetUnfolderBase]: 50/1053 cut-off events. [2024-11-10 14:39:27,831 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:39:27,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1053 events. 50/1053 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4825 event pairs, 38 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1125. Up to 81 conditions per place. [2024-11-10 14:39:27,842 INFO L140 encePairwiseOnDemand]: 501/504 looper letters, 14 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2024-11-10 14:39:27,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 446 transitions, 951 flow [2024-11-10 14:39:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1403 transitions. [2024-11-10 14:39:27,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9279100529100529 [2024-11-10 14:39:27,847 INFO L175 Difference]: Start difference. First operand has 451 places, 447 transitions, 921 flow. Second operand 3 states and 1403 transitions. [2024-11-10 14:39:27,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 446 transitions, 951 flow [2024-11-10 14:39:27,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 446 transitions, 931 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:27,856 INFO L231 Difference]: Finished difference. Result has 447 places, 446 transitions, 903 flow [2024-11-10 14:39:27,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=447, PETRI_TRANSITIONS=446} [2024-11-10 14:39:27,857 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -19 predicate places. [2024-11-10 14:39:27,857 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 446 transitions, 903 flow [2024-11-10 14:39:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:27,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:27,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:39:27,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2031870153, now seen corresponding path program 1 times [2024-11-10 14:39:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099779704] [2024-11-10 14:39:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:27,907 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:39:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:27,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099779704] [2024-11-10 14:39:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099779704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473022576] [2024-11-10 14:39:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:27,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:27,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 504 [2024-11-10 14:39:27,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 0 states have call successors, (0), 0 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:39:27,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:27,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 504 [2024-11-10 14:39:27,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:28,087 INFO L124 PetriNetUnfolderBase]: 61/1445 cut-off events. [2024-11-10 14:39:28,088 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-10 14:39:28,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 1445 events. 61/1445 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7875 event pairs, 39 based on Foata normal form. 0/1304 useless extension candidates. Maximal degree in co-relation 1512. Up to 93 conditions per place. [2024-11-10 14:39:28,108 INFO L140 encePairwiseOnDemand]: 499/504 looper letters, 16 selfloop transitions, 1 changer transitions 0/442 dead transitions. [2024-11-10 14:39:28,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 442 transitions, 929 flow [2024-11-10 14:39:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2024-11-10 14:39:28,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9246031746031746 [2024-11-10 14:39:28,111 INFO L175 Difference]: Start difference. First operand has 447 places, 446 transitions, 903 flow. Second operand 3 states and 1398 transitions. [2024-11-10 14:39:28,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 442 transitions, 929 flow [2024-11-10 14:39:28,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 442 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:28,117 INFO L231 Difference]: Finished difference. Result has 443 places, 442 transitions, 893 flow [2024-11-10 14:39:28,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=443, PETRI_TRANSITIONS=442} [2024-11-10 14:39:28,119 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -23 predicate places. [2024-11-10 14:39:28,119 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 442 transitions, 893 flow [2024-11-10 14:39:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 460.0) internal successors, (1380), 3 states have internal predecessors, (1380), 0 states have call successors, (0), 0 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:39:28,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:28,121 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] [2024-11-10 14:39:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:39:28,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash 497546953, now seen corresponding path program 1 times [2024-11-10 14:39:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60976941] [2024-11-10 14:39:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:28,198 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:39:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60976941] [2024-11-10 14:39:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60976941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:28,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:28,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887603325] [2024-11-10 14:39:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:28,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:28,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:28,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 504 [2024-11-10 14:39:28,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 442 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:39:28,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:28,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 504 [2024-11-10 14:39:28,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:28,404 INFO L124 PetriNetUnfolderBase]: 41/1276 cut-off events. [2024-11-10 14:39:28,405 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:39:28,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 1276 events. 41/1276 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5250 event pairs, 15 based on Foata normal form. 1/1151 useless extension candidates. Maximal degree in co-relation 1323. Up to 37 conditions per place. [2024-11-10 14:39:28,420 INFO L140 encePairwiseOnDemand]: 499/504 looper letters, 12 selfloop transitions, 2 changer transitions 2/444 dead transitions. [2024-11-10 14:39:28,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 444 transitions, 931 flow [2024-11-10 14:39:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2024-11-10 14:39:28,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2024-11-10 14:39:28,424 INFO L175 Difference]: Start difference. First operand has 443 places, 442 transitions, 893 flow. Second operand 3 states and 1413 transitions. [2024-11-10 14:39:28,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 444 transitions, 931 flow [2024-11-10 14:39:28,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:28,431 INFO L231 Difference]: Finished difference. Result has 442 places, 438 transitions, 887 flow [2024-11-10 14:39:28,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=442, PETRI_TRANSITIONS=438} [2024-11-10 14:39:28,434 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -24 predicate places. [2024-11-10 14:39:28,434 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 438 transitions, 887 flow [2024-11-10 14:39:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.0) internal successors, (1398), 3 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:39:28,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:28,436 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] [2024-11-10 14:39:28,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:39:28,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:28,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1401283946, now seen corresponding path program 1 times [2024-11-10 14:39:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234287836] [2024-11-10 14:39:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:28,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:28,489 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:39:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234287836] [2024-11-10 14:39:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234287836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:28,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:28,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823525876] [2024-11-10 14:39:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:28,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 504 [2024-11-10 14:39:28,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 438 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:28,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:28,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 504 [2024-11-10 14:39:28,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:28,984 INFO L124 PetriNetUnfolderBase]: 185/3166 cut-off events. [2024-11-10 14:39:28,984 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-10 14:39:29,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 3166 events. 185/3166 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 24590 event pairs, 48 based on Foata normal form. 0/2852 useless extension candidates. Maximal degree in co-relation 3428. Up to 262 conditions per place. [2024-11-10 14:39:29,015 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 18 selfloop transitions, 3 changer transitions 0/442 dead transitions. [2024-11-10 14:39:29,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 442 transitions, 941 flow [2024-11-10 14:39:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2024-11-10 14:39:29,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325396825396826 [2024-11-10 14:39:29,019 INFO L175 Difference]: Start difference. First operand has 442 places, 438 transitions, 887 flow. Second operand 3 states and 1410 transitions. [2024-11-10 14:39:29,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 442 transitions, 941 flow [2024-11-10 14:39:29,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 442 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:29,028 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 898 flow [2024-11-10 14:39:29,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-11-10 14:39:29,029 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -28 predicate places. [2024-11-10 14:39:29,029 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 898 flow [2024-11-10 14:39:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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:39:29,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:29,030 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] [2024-11-10 14:39:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:39:29,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1660927571, now seen corresponding path program 1 times [2024-11-10 14:39:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455448735] [2024-11-10 14:39:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:29,202 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:39:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455448735] [2024-11-10 14:39:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455448735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:39:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098877043] [2024-11-10 14:39:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:39:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:29,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:39:29,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:39:29,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 504 [2024-11-10 14:39:29,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 898 flow. Second operand has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 0 states have call successors, (0), 0 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:39:29,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:29,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 504 [2024-11-10 14:39:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:29,944 INFO L124 PetriNetUnfolderBase]: 164/3601 cut-off events. [2024-11-10 14:39:29,944 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:39:29,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 3601 events. 164/3601 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 25552 event pairs, 67 based on Foata normal form. 8/3280 useless extension candidates. Maximal degree in co-relation 3930. Up to 148 conditions per place. [2024-11-10 14:39:29,980 INFO L140 encePairwiseOnDemand]: 483/504 looper letters, 35 selfloop transitions, 28 changer transitions 0/470 dead transitions. [2024-11-10 14:39:29,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 470 transitions, 1095 flow [2024-11-10 14:39:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:39:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:39:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4544 transitions. [2024-11-10 14:39:29,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9015873015873016 [2024-11-10 14:39:29,987 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 898 flow. Second operand 10 states and 4544 transitions. [2024-11-10 14:39:29,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 470 transitions, 1095 flow [2024-11-10 14:39:29,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 470 transitions, 1095 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:39:29,992 INFO L231 Difference]: Finished difference. Result has 451 places, 454 transitions, 1027 flow [2024-11-10 14:39:29,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1027, PETRI_PLACES=451, PETRI_TRANSITIONS=454} [2024-11-10 14:39:29,993 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -15 predicate places. [2024-11-10 14:39:29,993 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 454 transitions, 1027 flow [2024-11-10 14:39:29,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 451.0) internal successors, (3157), 7 states have internal predecessors, (3157), 0 states have call successors, (0), 0 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:39:29,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:29,995 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] [2024-11-10 14:39:29,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:39:29,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:29,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:29,996 INFO L85 PathProgramCache]: Analyzing trace with hash 386771729, now seen corresponding path program 1 times [2024-11-10 14:39:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220846937] [2024-11-10 14:39:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:29,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:30,085 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:39:30,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220846937] [2024-11-10 14:39:30,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220846937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:30,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:30,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111482466] [2024-11-10 14:39:30,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:30,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:39:30,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:30,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:39:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:39:30,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 504 [2024-11-10 14:39:30,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 454 transitions, 1027 flow. Second operand has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 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:39:30,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:30,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 504 [2024-11-10 14:39:30,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:30,647 INFO L124 PetriNetUnfolderBase]: 200/2728 cut-off events. [2024-11-10 14:39:30,647 INFO L125 PetriNetUnfolderBase]: For 101/110 co-relation queries the response was YES. [2024-11-10 14:39:30,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 2728 events. 200/2728 cut-off events. For 101/110 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 19237 event pairs, 85 based on Foata normal form. 12/2484 useless extension candidates. Maximal degree in co-relation 3174. Up to 212 conditions per place. [2024-11-10 14:39:30,684 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 26 selfloop transitions, 5 changer transitions 0/466 dead transitions. [2024-11-10 14:39:30,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 466 transitions, 1120 flow [2024-11-10 14:39:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:39:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:39:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2327 transitions. [2024-11-10 14:39:30,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234126984126985 [2024-11-10 14:39:30,690 INFO L175 Difference]: Start difference. First operand has 451 places, 454 transitions, 1027 flow. Second operand 5 states and 2327 transitions. [2024-11-10 14:39:30,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 466 transitions, 1120 flow [2024-11-10 14:39:30,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 466 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:39:30,700 INFO L231 Difference]: Finished difference. Result has 457 places, 456 transitions, 1052 flow [2024-11-10 14:39:30,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1052, PETRI_PLACES=457, PETRI_TRANSITIONS=456} [2024-11-10 14:39:30,702 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -9 predicate places. [2024-11-10 14:39:30,702 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 456 transitions, 1052 flow [2024-11-10 14:39:30,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 461.0) internal successors, (2305), 5 states have internal predecessors, (2305), 0 states have call successors, (0), 0 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:39:30,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:30,704 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] [2024-11-10 14:39:30,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:39:30,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:30,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1501053071, now seen corresponding path program 1 times [2024-11-10 14:39:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:30,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727410331] [2024-11-10 14:39:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:31,095 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:39:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727410331] [2024-11-10 14:39:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727410331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:31,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:31,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825287640] [2024-11-10 14:39:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:31,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:31,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:31,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 456 transitions, 1052 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 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:39:31,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:31,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:31,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:31,921 INFO L124 PetriNetUnfolderBase]: 250/3105 cut-off events. [2024-11-10 14:39:31,921 INFO L125 PetriNetUnfolderBase]: For 232/243 co-relation queries the response was YES. [2024-11-10 14:39:31,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 3105 events. 250/3105 cut-off events. For 232/243 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22149 event pairs, 71 based on Foata normal form. 0/2822 useless extension candidates. Maximal degree in co-relation 3765. Up to 243 conditions per place. [2024-11-10 14:39:31,964 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 34 selfloop transitions, 5 changer transitions 0/467 dead transitions. [2024-11-10 14:39:31,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 467 transitions, 1160 flow [2024-11-10 14:39:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2756 transitions. [2024-11-10 14:39:31,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-11-10 14:39:31,968 INFO L175 Difference]: Start difference. First operand has 457 places, 456 transitions, 1052 flow. Second operand 6 states and 2756 transitions. [2024-11-10 14:39:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 467 transitions, 1160 flow [2024-11-10 14:39:31,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 467 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:31,978 INFO L231 Difference]: Finished difference. Result has 459 places, 455 transitions, 1055 flow [2024-11-10 14:39:31,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=459, PETRI_TRANSITIONS=455} [2024-11-10 14:39:31,980 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -7 predicate places. [2024-11-10 14:39:31,980 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 455 transitions, 1055 flow [2024-11-10 14:39:31,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 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:39:31,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:31,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:39:31,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -596974864, now seen corresponding path program 1 times [2024-11-10 14:39:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891686258] [2024-11-10 14:39:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:32,017 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:39:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891686258] [2024-11-10 14:39:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891686258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910247451] [2024-11-10 14:39:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:32,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:32,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 504 [2024-11-10 14:39:32,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 455 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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:39:32,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:32,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 504 [2024-11-10 14:39:32,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:33,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][227], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), Black: 515#true, 555#(= |#race~B~0| 0), 159#L65-31true, 306#L86-1true, 496#(= |#race~N~0| 0), 517#(= |#race~A~0| 0), 150#L56-31true, 106#L48-35true, 519#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 525#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 547#true, Black: 531#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 524#(<= ~N~0 0)]) [2024-11-10 14:39:33,072 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-10 14:39:33,072 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-10 14:39:33,072 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:33,072 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:33,111 INFO L124 PetriNetUnfolderBase]: 384/7934 cut-off events. [2024-11-10 14:39:33,111 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-10 14:39:33,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8885 conditions, 7934 events. 384/7934 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 76290 event pairs, 98 based on Foata normal form. 0/7305 useless extension candidates. Maximal degree in co-relation 8836. Up to 490 conditions per place. [2024-11-10 14:39:33,165 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 18 selfloop transitions, 3 changer transitions 0/459 dead transitions. [2024-11-10 14:39:33,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 1109 flow [2024-11-10 14:39:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2024-11-10 14:39:33,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325396825396826 [2024-11-10 14:39:33,167 INFO L175 Difference]: Start difference. First operand has 459 places, 455 transitions, 1055 flow. Second operand 3 states and 1410 transitions. [2024-11-10 14:39:33,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 1109 flow [2024-11-10 14:39:33,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:33,174 INFO L231 Difference]: Finished difference. Result has 454 places, 455 transitions, 1060 flow [2024-11-10 14:39:33,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=454, PETRI_TRANSITIONS=455} [2024-11-10 14:39:33,175 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -12 predicate places. [2024-11-10 14:39:33,175 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 455 transitions, 1060 flow [2024-11-10 14:39:33,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.6666666666667) internal successors, (1391), 3 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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:39:33,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:33,176 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] [2024-11-10 14:39:33,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:39:33,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:33,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash -478744199, now seen corresponding path program 1 times [2024-11-10 14:39:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281412320] [2024-11-10 14:39:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:33,466 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:39:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:33,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281412320] [2024-11-10 14:39:33,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281412320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:33,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:33,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115921777] [2024-11-10 14:39:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:33,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:33,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 455 transitions, 1060 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 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:39:33,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:33,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:33,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:34,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][228], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), Black: 515#true, 555#(= |#race~B~0| 0), 557#true, Black: 553#true, 159#L65-31true, 306#L86-1true, 496#(= |#race~N~0| 0), 150#L56-31true, 517#(= |#race~A~0| 0), 106#L48-35true, 519#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 525#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 531#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 524#(<= ~N~0 0)]) [2024-11-10 14:39:34,622 INFO L294 olderBase$Statistics]: this new event has 412 ancestors and is cut-off event [2024-11-10 14:39:34,622 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:34,622 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:34,623 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-10 14:39:34,627 INFO L124 PetriNetUnfolderBase]: 472/5340 cut-off events. [2024-11-10 14:39:34,627 INFO L125 PetriNetUnfolderBase]: For 256/271 co-relation queries the response was YES. [2024-11-10 14:39:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 5340 events. 472/5340 cut-off events. For 256/271 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 45528 event pairs, 81 based on Foata normal form. 0/4939 useless extension candidates. Maximal degree in co-relation 6418. Up to 277 conditions per place. [2024-11-10 14:39:34,668 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 32 selfloop transitions, 5 changer transitions 0/466 dead transitions. [2024-11-10 14:39:34,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 466 transitions, 1164 flow [2024-11-10 14:39:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2756 transitions. [2024-11-10 14:39:34,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-11-10 14:39:34,673 INFO L175 Difference]: Start difference. First operand has 454 places, 455 transitions, 1060 flow. Second operand 6 states and 2756 transitions. [2024-11-10 14:39:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 466 transitions, 1164 flow [2024-11-10 14:39:34,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 466 transitions, 1164 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:39:34,680 INFO L231 Difference]: Finished difference. Result has 458 places, 454 transitions, 1068 flow [2024-11-10 14:39:34,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1068, PETRI_PLACES=458, PETRI_TRANSITIONS=454} [2024-11-10 14:39:34,681 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -8 predicate places. [2024-11-10 14:39:34,681 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 454 transitions, 1068 flow [2024-11-10 14:39:34,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 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:39:34,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:34,682 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:34,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:39:34,682 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -555763085, now seen corresponding path program 1 times [2024-11-10 14:39:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259991402] [2024-11-10 14:39:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:35,073 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:39:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259991402] [2024-11-10 14:39:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259991402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477909133] [2024-11-10 14:39:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:35,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:35,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 454 transitions, 1068 flow. Second operand has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 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:39:35,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:35,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:35,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:36,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][226], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), Black: 515#true, 555#(= |#race~B~0| 0), 557#true, 159#L65-31true, Black: 553#true, 306#L86-1true, 496#(= |#race~N~0| 0), 517#(= |#race~A~0| 0), 150#L56-31true, 106#L48-35true, 519#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 525#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 531#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 524#(<= ~N~0 0), 563#true]) [2024-11-10 14:39:36,063 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-10 14:39:36,063 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:36,063 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:36,063 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:36,136 INFO L124 PetriNetUnfolderBase]: 317/4287 cut-off events. [2024-11-10 14:39:36,136 INFO L125 PetriNetUnfolderBase]: For 248/259 co-relation queries the response was YES. [2024-11-10 14:39:36,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5282 conditions, 4287 events. 317/4287 cut-off events. For 248/259 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 35114 event pairs, 92 based on Foata normal form. 0/3954 useless extension candidates. Maximal degree in co-relation 5231. Up to 269 conditions per place. [2024-11-10 14:39:36,196 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 34 selfloop transitions, 5 changer transitions 0/465 dead transitions. [2024-11-10 14:39:36,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 465 transitions, 1176 flow [2024-11-10 14:39:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2756 transitions. [2024-11-10 14:39:36,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-11-10 14:39:36,200 INFO L175 Difference]: Start difference. First operand has 458 places, 454 transitions, 1068 flow. Second operand 6 states and 2756 transitions. [2024-11-10 14:39:36,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 465 transitions, 1176 flow [2024-11-10 14:39:36,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 465 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:36,206 INFO L231 Difference]: Finished difference. Result has 457 places, 453 transitions, 1066 flow [2024-11-10 14:39:36,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1066, PETRI_PLACES=457, PETRI_TRANSITIONS=453} [2024-11-10 14:39:36,207 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -9 predicate places. [2024-11-10 14:39:36,208 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 453 transitions, 1066 flow [2024-11-10 14:39:36,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.6666666666667) internal successors, (2728), 6 states have internal predecessors, (2728), 0 states have call successors, (0), 0 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:39:36,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:36,209 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] [2024-11-10 14:39:36,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:39:36,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1849028259, now seen corresponding path program 1 times [2024-11-10 14:39:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260262418] [2024-11-10 14:39:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:36,470 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:39:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260262418] [2024-11-10 14:39:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260262418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:36,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881788253] [2024-11-10 14:39:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:36,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:36,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 453 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 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:39:36,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:36,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:37,345 INFO L124 PetriNetUnfolderBase]: 382/4549 cut-off events. [2024-11-10 14:39:37,345 INFO L125 PetriNetUnfolderBase]: For 215/230 co-relation queries the response was YES. [2024-11-10 14:39:37,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 4549 events. 382/4549 cut-off events. For 215/230 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 38132 event pairs, 78 based on Foata normal form. 0/4218 useless extension candidates. Maximal degree in co-relation 5480. Up to 278 conditions per place. [2024-11-10 14:39:37,393 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 32 selfloop transitions, 5 changer transitions 14/464 dead transitions. [2024-11-10 14:39:37,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 464 transitions, 1170 flow [2024-11-10 14:39:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2756 transitions. [2024-11-10 14:39:37,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113756613756614 [2024-11-10 14:39:37,396 INFO L175 Difference]: Start difference. First operand has 457 places, 453 transitions, 1066 flow. Second operand 6 states and 2756 transitions. [2024-11-10 14:39:37,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 464 transitions, 1170 flow [2024-11-10 14:39:37,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 464 transitions, 1160 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:37,402 INFO L231 Difference]: Finished difference. Result has 456 places, 438 transitions, 993 flow [2024-11-10 14:39:37,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=993, PETRI_PLACES=456, PETRI_TRANSITIONS=438} [2024-11-10 14:39:37,403 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -10 predicate places. [2024-11-10 14:39:37,403 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 438 transitions, 993 flow [2024-11-10 14:39:37,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 454.8333333333333) internal successors, (2729), 6 states have internal predecessors, (2729), 0 states have call successors, (0), 0 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:39:37,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:37,404 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] [2024-11-10 14:39:37,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:39:37,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:37,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 876783852, now seen corresponding path program 1 times [2024-11-10 14:39:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:37,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90800992] [2024-11-10 14:39:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:37,666 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:39:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90800992] [2024-11-10 14:39:37,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90800992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:37,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497066187] [2024-11-10 14:39:37,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:37,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:37,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:37,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 438 transitions, 993 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:39:37,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:37,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:38,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_6|} AuxVars[] AssignedVars[#race~A~0][222], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), 569#true, 575#true, Black: 515#true, 555#(= |#race~B~0| 0), Black: 553#true, 159#L65-31true, 496#(= |#race~N~0| 0), 306#L86-1true, 150#L56-31true, 517#(= |#race~A~0| 0), 106#L48-35true, 519#true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 525#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 531#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 524#(<= ~N~0 0)]) [2024-11-10 14:39:38,494 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-10 14:39:38,494 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:38,494 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:38,494 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:38,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9) InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} AuxVars[] AssignedVars[~res2~0][439], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), 418#L64-5true, 575#true, Black: 515#true, 555#(= |#race~B~0| 0), Black: 553#true, 496#(= |#race~N~0| 0), 517#(= |#race~A~0| 0), 519#true, 574#(and (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)) 0)), 165#L89true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 525#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), Black: 531#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 524#(<= ~N~0 0)]) [2024-11-10 14:39:38,535 INFO L294 olderBase$Statistics]: this new event has 410 ancestors and is cut-off event [2024-11-10 14:39:38,535 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-11-10 14:39:38,535 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2024-11-10 14:39:38,535 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:39:38,591 INFO L124 PetriNetUnfolderBase]: 294/4126 cut-off events. [2024-11-10 14:39:38,591 INFO L125 PetriNetUnfolderBase]: For 57/66 co-relation queries the response was YES. [2024-11-10 14:39:38,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 4126 events. 294/4126 cut-off events. For 57/66 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30513 event pairs, 64 based on Foata normal form. 0/3851 useless extension candidates. Maximal degree in co-relation 4986. Up to 202 conditions per place. [2024-11-10 14:39:38,640 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 36 selfloop transitions, 5 changer transitions 0/453 dead transitions. [2024-11-10 14:39:38,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 453 transitions, 1113 flow [2024-11-10 14:39:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2760 transitions. [2024-11-10 14:39:38,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126984126984127 [2024-11-10 14:39:38,643 INFO L175 Difference]: Start difference. First operand has 456 places, 438 transitions, 993 flow. Second operand 6 states and 2760 transitions. [2024-11-10 14:39:38,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 453 transitions, 1113 flow [2024-11-10 14:39:38,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 453 transitions, 1065 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-11-10 14:39:38,651 INFO L231 Difference]: Finished difference. Result has 444 places, 437 transitions, 953 flow [2024-11-10 14:39:38,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=444, PETRI_TRANSITIONS=437} [2024-11-10 14:39:38,652 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -22 predicate places. [2024-11-10 14:39:38,652 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 437 transitions, 953 flow [2024-11-10 14:39:38,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:39:38,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:38,653 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] [2024-11-10 14:39:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:39:38,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2054142512, now seen corresponding path program 1 times [2024-11-10 14:39:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727235922] [2024-11-10 14:39:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:39,007 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:39:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727235922] [2024-11-10 14:39:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727235922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149177201] [2024-11-10 14:39:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:39,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:39,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:39,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 504 [2024-11-10 14:39:39,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 437 transitions, 953 flow. Second operand has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:39:39,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:39,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 504 [2024-11-10 14:39:39,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:39,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L56-32-->L56-31: Formula: (= |v_#race~A~0_6| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_6|} AuxVars[] AssignedVars[#race~A~0][216], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), 575#true, Black: 515#true, 555#(= |#race~B~0| 0), Black: 553#true, 159#L65-31true, 496#(= |#race~N~0| 0), 306#L86-1true, 517#(= |#race~A~0| 0), 150#L56-31true, 106#L48-35true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 581#true]) [2024-11-10 14:39:39,748 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-10 14:39:39,748 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:39,748 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:39,748 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:39,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L66-1-->L64-5: Formula: (= |v_thread3Thread1of1ForFork0_~tmp~1#1_3| v_~res2~0_9) InVars {thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} OutVars{~res2~0=v_~res2~0_9, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_3|} AuxVars[] AssignedVars[~res2~0][438], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), 418#L64-5true, 575#true, Black: 515#true, 555#(= |#race~B~0| 0), Black: 553#true, 496#(= |#race~N~0| 0), 517#(= |#race~A~0| 0), Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 165#L89true, 581#true]) [2024-11-10 14:39:39,768 INFO L294 olderBase$Statistics]: this new event has 410 ancestors and is cut-off event [2024-11-10 14:39:39,768 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-11-10 14:39:39,768 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2024-11-10 14:39:39,768 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:39:39,790 INFO L124 PetriNetUnfolderBase]: 241/3938 cut-off events. [2024-11-10 14:39:39,790 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-10 14:39:39,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 3938 events. 241/3938 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 30211 event pairs, 70 based on Foata normal form. 0/3650 useless extension candidates. Maximal degree in co-relation 4569. Up to 196 conditions per place. [2024-11-10 14:39:39,835 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 36 selfloop transitions, 5 changer transitions 0/452 dead transitions. [2024-11-10 14:39:39,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 452 transitions, 1073 flow [2024-11-10 14:39:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2760 transitions. [2024-11-10 14:39:39,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126984126984127 [2024-11-10 14:39:39,838 INFO L175 Difference]: Start difference. First operand has 444 places, 437 transitions, 953 flow. Second operand 6 states and 2760 transitions. [2024-11-10 14:39:39,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 452 transitions, 1073 flow [2024-11-10 14:39:39,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 452 transitions, 1063 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:39,844 INFO L231 Difference]: Finished difference. Result has 443 places, 436 transitions, 951 flow [2024-11-10 14:39:39,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=443, PETRI_TRANSITIONS=436} [2024-11-10 14:39:39,845 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -23 predicate places. [2024-11-10 14:39:39,845 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 436 transitions, 951 flow [2024-11-10 14:39:39,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.8333333333333) internal successors, (2735), 6 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:39:39,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:39,846 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] [2024-11-10 14:39:39,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:39:39,846 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-10 14:39:39,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1528756372, now seen corresponding path program 1 times [2024-11-10 14:39:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035019964] [2024-11-10 14:39:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:39,893 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:39:39,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:39,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035019964] [2024-11-10 14:39:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035019964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:39,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:39,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700547586] [2024-11-10 14:39:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:39,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:39,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:39,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:39,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 465 out of 504 [2024-11-10 14:39:39,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 436 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:39:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 465 of 504 [2024-11-10 14:39:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:40,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L65-32-->L65-31: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][237], [Black: 543#(<= (+ ~M~0 1) 0), Black: 544#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 511#(= |#race~M~0| 0), 587#true, Black: 515#true, 555#(= |#race~B~0| 0), Black: 553#true, 159#L65-31true, 496#(= |#race~N~0| 0), 306#L86-1true, 517#(= |#race~A~0| 0), 150#L56-31true, 106#L48-35true, Black: 529#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 581#true]) [2024-11-10 14:39:40,379 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-10 14:39:40,379 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:40,379 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-10 14:39:40,379 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-10 14:39:40,439 INFO L124 PetriNetUnfolderBase]: 224/4175 cut-off events. [2024-11-10 14:39:40,439 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-10 14:39:40,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 4175 events. 224/4175 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 31028 event pairs, 74 based on Foata normal form. 0/3898 useless extension candidates. Maximal degree in co-relation 4731. Up to 202 conditions per place. [2024-11-10 14:39:40,480 INFO L140 encePairwiseOnDemand]: 501/504 looper letters, 0 selfloop transitions, 0 changer transitions 439/439 dead transitions. [2024-11-10 14:39:40,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 991 flow [2024-11-10 14:39:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1412 transitions. [2024-11-10 14:39:40,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338624338624338 [2024-11-10 14:39:40,482 INFO L175 Difference]: Start difference. First operand has 443 places, 436 transitions, 951 flow. Second operand 3 states and 1412 transitions. [2024-11-10 14:39:40,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 991 flow [2024-11-10 14:39:40,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 439 transitions, 981 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:40,487 INFO L231 Difference]: Finished difference. Result has 439 places, 0 transitions, 0 flow [2024-11-10 14:39:40,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=439, PETRI_TRANSITIONS=0} [2024-11-10 14:39:40,488 INFO L277 CegarLoopForPetriNet]: 466 programPoint places, -27 predicate places. [2024-11-10 14:39:40,488 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 0 transitions, 0 flow [2024-11-10 14:39:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 466.6666666666667) internal successors, (1400), 3 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:39:40,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2024-11-10 14:39:40,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2024-11-10 14:39:40,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2024-11-10 14:39:40,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2024-11-10 14:39:40,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2024-11-10 14:39:40,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2024-11-10 14:39:40,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2024-11-10 14:39:40,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2024-11-10 14:39:40,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2024-11-10 14:39:40,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2024-11-10 14:39:40,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2024-11-10 14:39:40,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2024-11-10 14:39:40,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2024-11-10 14:39:40,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:39:40,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:40,511 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:39:40,512 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:39:40,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:39:40 BasicIcfg [2024-11-10 14:39:40,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:39:40,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:39:40,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:39:40,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:39:40,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:22" (3/4) ... [2024-11-10 14:39:40,527 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:39:40,529 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:39:40,529 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:39:40,529 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:39:40,538 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-11-10 14:39:40,538 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:39:40,542 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:39:40,542 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:39:40,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:39:40,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:39:40,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:39:40,624 INFO L158 Benchmark]: Toolchain (without parser) took 19454.17ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 120.4MB in the beginning and 635.4MB in the end (delta: -515.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-10 14:39:40,624 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:39:40,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.51ms. Allocated memory is still 157.3MB. Free memory was 120.4MB in the beginning and 105.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:39:40,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.84ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 102.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:39:40,625 INFO L158 Benchmark]: Boogie Preprocessor took 48.71ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 99.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:39:40,625 INFO L158 Benchmark]: IcfgBuilder took 773.34ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 60.5MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 14:39:40,625 INFO L158 Benchmark]: TraceAbstraction took 18156.93ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 59.6MB in the beginning and 641.7MB in the end (delta: -582.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-10 14:39:40,626 INFO L158 Benchmark]: Witness Printer took 103.19ms. Allocated memory is still 1.7GB. Free memory was 641.7MB in the beginning and 635.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:39:40,627 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.51ms. Allocated memory is still 157.3MB. Free memory was 120.4MB in the beginning and 105.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.84ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 102.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.71ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 99.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 773.34ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 60.5MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18156.93ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 59.6MB in the beginning and 641.7MB in the end (delta: -582.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 103.19ms. Allocated memory is still 1.7GB. Free memory was 641.7MB in the beginning and 635.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 752 locations, 51 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2051 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3644 IncrementalHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 595 mSolverCounterUnsat, 144 mSDtfsCounter, 3644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=14, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 3346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:39:40,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE