./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:15:03,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:15:03,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:15:03,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:15:03,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:15:03,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:15:03,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:15:03,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:15:03,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:15:03,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:15:03,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:15:03,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:15:03,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:15:03,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:15:03,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:15:03,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:15:03,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:15:03,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:15:03,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:15:03,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:15:03,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:15:03,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:15:03,198 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:15:03,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:15:03,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:15:03,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:03,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:15:03,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:15:03,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:15:03,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:15:03,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:15:03,202 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-clean/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-clean/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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2024-10-11 17:15:03,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:15:03,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:15:03,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:15:03,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:15:03,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:15:03,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-10-11 17:15:04,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:15:04,827 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:15:04,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-10-11 17:15:04,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c355d2bdb/f093e6f20b824aee9802db1e43938708/FLAGb43efa110 [2024-10-11 17:15:04,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c355d2bdb/f093e6f20b824aee9802db1e43938708 [2024-10-11 17:15:04,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:15:04,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:15:04,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:04,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:15:04,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:15:04,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:04" (1/1) ... [2024-10-11 17:15:04,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0156d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:04, skipping insertion in model container [2024-10-11 17:15:04,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:15:04" (1/1) ... [2024-10-11 17:15:04,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:15:05,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:05,104 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:15:05,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:15:05,143 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:15:05,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05 WrapperNode [2024-10-11 17:15:05,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:15:05,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:05,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:15:05,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:15:05,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,180 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 191 [2024-10-11 17:15:05,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:15:05,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:15:05,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:15:05,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:15:05,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:15:05,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:15:05,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:15:05,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:15:05,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (1/1) ... [2024-10-11 17:15:05,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:15:05,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:15:05,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:15:05,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:15:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:15:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:15:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:15:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:15:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:15:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:15:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:15:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:15:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:15:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:15:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:15:05,318 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:15:05,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:15:05,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:15:05,964 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:15:05,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:15:05,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:15:05,986 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:15:05,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:05 BoogieIcfgContainer [2024-10-11 17:15:05,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:15:05,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:15:05,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:15:05,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:15:05,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:15:04" (1/3) ... [2024-10-11 17:15:05,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d98f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:05, skipping insertion in model container [2024-10-11 17:15:05,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:15:05" (2/3) ... [2024-10-11 17:15:05,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d98f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:15:05, skipping insertion in model container [2024-10-11 17:15:05,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:05" (3/3) ... [2024-10-11 17:15:05,994 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2024-10-11 17:15:06,007 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:15:06,007 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2024-10-11 17:15:06,008 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:15:06,112 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:15:06,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 475 transitions, 964 flow [2024-10-11 17:15:06,287 INFO L124 PetriNetUnfolderBase]: 26/473 cut-off events. [2024-10-11 17:15:06,289 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:15:06,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 473 events. 26/473 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1055 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 292. Up to 3 conditions per place. [2024-10-11 17:15:06,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 475 transitions, 964 flow [2024-10-11 17:15:06,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 453 transitions, 918 flow [2024-10-11 17:15:06,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:15:06,323 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;@9d6bcc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:15:06,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-10-11 17:15:06,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:15:06,331 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-11 17:15:06,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:15:06,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:06,332 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] [2024-10-11 17:15:06,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 497602862, now seen corresponding path program 1 times [2024-10-11 17:15:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449876175] [2024-10-11 17:15:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449876175] [2024-10-11 17:15:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449876175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:06,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:06,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152351925] [2024-10-11 17:15:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:06,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-10-11 17:15:06,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 453 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:06,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:06,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-10-11 17:15:06,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:06,782 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2024-10-11 17:15:06,783 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:15:06,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3399 event pairs, 8 based on Foata normal form. 15/650 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2024-10-11 17:15:06,793 INFO L140 encePairwiseOnDemand]: 462/475 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2024-10-11 17:15:06,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2024-10-11 17:15:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-10-11 17:15:06,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-10-11 17:15:06,815 INFO L175 Difference]: Start difference. First operand has 436 places, 453 transitions, 918 flow. Second operand 3 states and 1368 transitions. [2024-10-11 17:15:06,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2024-10-11 17:15:06,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:15:06,831 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2024-10-11 17:15:06,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2024-10-11 17:15:06,836 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2024-10-11 17:15:06,838 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2024-10-11 17:15:06,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:06,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:06,839 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] [2024-10-11 17:15:06,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:15:06,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:06,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1667234327, now seen corresponding path program 1 times [2024-10-11 17:15:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458815983] [2024-10-11 17:15:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:06,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:06,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458815983] [2024-10-11 17:15:06,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458815983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:06,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:06,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327121844] [2024-10-11 17:15:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:06,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:06,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:06,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-10-11 17:15:06,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:06,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:06,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-10-11 17:15:06,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:07,036 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2024-10-11 17:15:07,037 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:15:07,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3344 event pairs, 8 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2024-10-11 17:15:07,042 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-10-11 17:15:07,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2024-10-11 17:15:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:07,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:07,047 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:07,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2024-10-11 17:15:07,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:07,053 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2024-10-11 17:15:07,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2024-10-11 17:15:07,055 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2024-10-11 17:15:07,055 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2024-10-11 17:15:07,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:07,056 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] [2024-10-11 17:15:07,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:15:07,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:07,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1874444480, now seen corresponding path program 1 times [2024-10-11 17:15:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807498249] [2024-10-11 17:15:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807498249] [2024-10-11 17:15:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807498249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677525526] [2024-10-11 17:15:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:07,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-10-11 17:15:07,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:07,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-10-11 17:15:07,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:07,250 INFO L124 PetriNetUnfolderBase]: 37/756 cut-off events. [2024-10-11 17:15:07,250 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-11 17:15:07,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 756 events. 37/756 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3113 event pairs, 8 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 758. Up to 32 conditions per place. [2024-10-11 17:15:07,257 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-11 17:15:07,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2024-10-11 17:15:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-10-11 17:15:07,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-10-11 17:15:07,261 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2024-10-11 17:15:07,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2024-10-11 17:15:07,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:07,267 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2024-10-11 17:15:07,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2024-10-11 17:15:07,269 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-10-11 17:15:07,269 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2024-10-11 17:15:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:07,270 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] [2024-10-11 17:15:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:15:07,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1310349700, now seen corresponding path program 1 times [2024-10-11 17:15:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699209126] [2024-10-11 17:15:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699209126] [2024-10-11 17:15:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699209126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:07,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:07,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947465404] [2024-10-11 17:15:07,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:07,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:07,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:07,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-10-11 17:15:07,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:07,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-10-11 17:15:07,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:07,432 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2024-10-11 17:15:07,433 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-11 17:15:07,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3165 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2024-10-11 17:15:07,439 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-11 17:15:07,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2024-10-11 17:15:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-10-11 17:15:07,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-10-11 17:15:07,443 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2024-10-11 17:15:07,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2024-10-11 17:15:07,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:07,448 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2024-10-11 17:15:07,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2024-10-11 17:15:07,450 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-10-11 17:15:07,450 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2024-10-11 17:15:07,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:07,452 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] [2024-10-11 17:15:07,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:15:07,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:07,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1664001257, now seen corresponding path program 1 times [2024-10-11 17:15:07,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:07,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064931949] [2024-10-11 17:15:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064931949] [2024-10-11 17:15:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064931949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880911937] [2024-10-11 17:15:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:07,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:07,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-10-11 17:15:07,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:07,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-10-11 17:15:07,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:07,671 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2024-10-11 17:15:07,671 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-11 17:15:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6783 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2024-10-11 17:15:07,681 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2024-10-11 17:15:07,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2024-10-11 17:15:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-10-11 17:15:07,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-10-11 17:15:07,685 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2024-10-11 17:15:07,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2024-10-11 17:15:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:07,691 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2024-10-11 17:15:07,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2024-10-11 17:15:07,693 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-10-11 17:15:07,694 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2024-10-11 17:15:07,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:07,696 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] [2024-10-11 17:15:07,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:15:07,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:07,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:07,697 INFO L85 PathProgramCache]: Analyzing trace with hash -521399676, now seen corresponding path program 1 times [2024-10-11 17:15:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57145962] [2024-10-11 17:15:07,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:07,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57145962] [2024-10-11 17:15:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57145962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090840211] [2024-10-11 17:15:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:07,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-10-11 17:15:07,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:07,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-10-11 17:15:07,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:07,874 INFO L124 PetriNetUnfolderBase]: 32/663 cut-off events. [2024-10-11 17:15:07,874 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:15:07,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 663 events. 32/663 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2468 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2024-10-11 17:15:07,881 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-10-11 17:15:07,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 427 transitions, 886 flow [2024-10-11 17:15:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:07,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:07,884 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:07,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 427 transitions, 886 flow [2024-10-11 17:15:07,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 427 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:07,890 INFO L231 Difference]: Finished difference. Result has 419 places, 427 transitions, 863 flow [2024-10-11 17:15:07,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=863, PETRI_PLACES=419, PETRI_TRANSITIONS=427} [2024-10-11 17:15:07,893 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-10-11 17:15:07,894 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 427 transitions, 863 flow [2024-10-11 17:15:07,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:07,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:07,895 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] [2024-10-11 17:15:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:15:07,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash 776827097, now seen corresponding path program 1 times [2024-10-11 17:15:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457988382] [2024-10-11 17:15:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:08,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457988382] [2024-10-11 17:15:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457988382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:08,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:08,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861679627] [2024-10-11 17:15:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:08,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:08,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:08,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:08,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 475 [2024-10-11 17:15:08,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 427 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:08,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:08,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 475 [2024-10-11 17:15:08,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:08,946 INFO L124 PetriNetUnfolderBase]: 429/2641 cut-off events. [2024-10-11 17:15:08,947 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-10-11 17:15:08,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3365 conditions, 2641 events. 429/2641 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19532 event pairs, 288 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 3310. Up to 691 conditions per place. [2024-10-11 17:15:08,959 INFO L140 encePairwiseOnDemand]: 463/475 looper letters, 52 selfloop transitions, 10 changer transitions 0/425 dead transitions. [2024-10-11 17:15:08,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 983 flow [2024-10-11 17:15:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2024-10-11 17:15:08,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624561403508771 [2024-10-11 17:15:08,964 INFO L175 Difference]: Start difference. First operand has 419 places, 427 transitions, 863 flow. Second operand 6 states and 2458 transitions. [2024-10-11 17:15:08,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 983 flow [2024-10-11 17:15:08,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 425 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:08,969 INFO L231 Difference]: Finished difference. Result has 420 places, 425 transitions, 875 flow [2024-10-11 17:15:08,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=420, PETRI_TRANSITIONS=425} [2024-10-11 17:15:08,970 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -16 predicate places. [2024-10-11 17:15:08,970 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 425 transitions, 875 flow [2024-10-11 17:15:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:08,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:08,972 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] [2024-10-11 17:15:08,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:15:08,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:08,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1861974171, now seen corresponding path program 1 times [2024-10-11 17:15:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:08,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589642196] [2024-10-11 17:15:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589642196] [2024-10-11 17:15:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589642196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377814189] [2024-10-11 17:15:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-10-11 17:15:09,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 425 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-10-11 17:15:09,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,127 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2024-10-11 17:15:09,127 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-10-11 17:15:09,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5752 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1120. Up to 82 conditions per place. [2024-10-11 17:15:09,137 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-10-11 17:15:09,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 420 transitions, 895 flow [2024-10-11 17:15:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-10-11 17:15:09,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-10-11 17:15:09,142 INFO L175 Difference]: Start difference. First operand has 420 places, 425 transitions, 875 flow. Second operand 3 states and 1349 transitions. [2024-10-11 17:15:09,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 420 transitions, 895 flow [2024-10-11 17:15:09,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:09,148 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2024-10-11 17:15:09,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2024-10-11 17:15:09,149 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-10-11 17:15:09,149 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2024-10-11 17:15:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:09,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:15:09,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -33180857, now seen corresponding path program 1 times [2024-10-11 17:15:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359288225] [2024-10-11 17:15:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359288225] [2024-10-11 17:15:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359288225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878040768] [2024-10-11 17:15:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-10-11 17:15:09,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-10-11 17:15:09,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,329 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2024-10-11 17:15:09,330 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:15:09,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2310 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2024-10-11 17:15:09,335 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2024-10-11 17:15:09,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2024-10-11 17:15:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:09,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:09,338 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:09,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2024-10-11 17:15:09,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:09,344 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2024-10-11 17:15:09,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2024-10-11 17:15:09,345 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-10-11 17:15:09,345 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2024-10-11 17:15:09,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,347 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] [2024-10-11 17:15:09,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:15:09,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -407844173, now seen corresponding path program 1 times [2024-10-11 17:15:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716028448] [2024-10-11 17:15:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716028448] [2024-10-11 17:15:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716028448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332138830] [2024-10-11 17:15:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-10-11 17:15:09,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-10-11 17:15:09,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,487 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2024-10-11 17:15:09,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:15:09,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6572 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2024-10-11 17:15:09,494 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-10-11 17:15:09,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2024-10-11 17:15:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:09,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:09,497 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:09,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2024-10-11 17:15:09,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:09,508 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2024-10-11 17:15:09,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2024-10-11 17:15:09,509 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-10-11 17:15:09,509 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2024-10-11 17:15:09,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,510 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,510 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] [2024-10-11 17:15:09,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:15:09,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1096191371, now seen corresponding path program 1 times [2024-10-11 17:15:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924692550] [2024-10-11 17:15:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924692550] [2024-10-11 17:15:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924692550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514045992] [2024-10-11 17:15:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-10-11 17:15:09,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-10-11 17:15:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,634 INFO L124 PetriNetUnfolderBase]: 70/1083 cut-off events. [2024-10-11 17:15:09,635 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-10-11 17:15:09,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 1083 events. 70/1083 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6241 event pairs, 16 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1111. Up to 61 conditions per place. [2024-10-11 17:15:09,640 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-10-11 17:15:09,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2024-10-11 17:15:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:09,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:09,643 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:09,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2024-10-11 17:15:09,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:09,648 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2024-10-11 17:15:09,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2024-10-11 17:15:09,649 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-10-11 17:15:09,649 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2024-10-11 17:15:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,650 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-10-11 17:15:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:15:09,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1346079127, now seen corresponding path program 1 times [2024-10-11 17:15:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974528770] [2024-10-11 17:15:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974528770] [2024-10-11 17:15:09,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974528770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898015285] [2024-10-11 17:15:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:09,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:09,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,780 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2024-10-11 17:15:09,781 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-11 17:15:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4224 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2024-10-11 17:15:09,786 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-10-11 17:15:09,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2024-10-11 17:15:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-10-11 17:15:09,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-10-11 17:15:09,790 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2024-10-11 17:15:09,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2024-10-11 17:15:09,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:09,795 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2024-10-11 17:15:09,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2024-10-11 17:15:09,797 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-10-11 17:15:09,797 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2024-10-11 17:15:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,798 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] [2024-10-11 17:15:09,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:15:09,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1206147859, now seen corresponding path program 1 times [2024-10-11 17:15:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531906520] [2024-10-11 17:15:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531906520] [2024-10-11 17:15:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531906520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:15:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231729517] [2024-10-11 17:15:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-10-11 17:15:09,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-10-11 17:15:09,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:09,928 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2024-10-11 17:15:09,928 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-11 17:15:09,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3839 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-10-11 17:15:09,933 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2024-10-11 17:15:09,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2024-10-11 17:15:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-10-11 17:15:09,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-10-11 17:15:09,936 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2024-10-11 17:15:09,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2024-10-11 17:15:09,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:09,941 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2024-10-11 17:15:09,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2024-10-11 17:15:09,942 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-10-11 17:15:09,942 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2024-10-11 17:15:09,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:09,943 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] [2024-10-11 17:15:09,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:15:09,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:09,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 65142256, now seen corresponding path program 1 times [2024-10-11 17:15:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:09,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398545446] [2024-10-11 17:15:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:09,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398545446] [2024-10-11 17:15:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398545446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418116696] [2024-10-11 17:15:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:09,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-10-11 17:15:09,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:09,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:09,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-10-11 17:15:09,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:10,108 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2024-10-11 17:15:10,109 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-10-11 17:15:10,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8574 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2024-10-11 17:15:10,119 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-10-11 17:15:10,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2024-10-11 17:15:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-10-11 17:15:10,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-10-11 17:15:10,122 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2024-10-11 17:15:10,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2024-10-11 17:15:10,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:10,127 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2024-10-11 17:15:10,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2024-10-11 17:15:10,128 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-10-11 17:15:10,129 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2024-10-11 17:15:10,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:10,130 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:10,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:15:10,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:10,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash -877457411, now seen corresponding path program 1 times [2024-10-11 17:15:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:10,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557468143] [2024-10-11 17:15:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:10,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:10,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557468143] [2024-10-11 17:15:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557468143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:10,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570245529] [2024-10-11 17:15:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:10,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:10,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:10,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:10,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:10,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:10,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:10,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][279], [Black: 493#true, 485#(= |#race~n2~0| 0), 161#L100true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), 509#true, Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), 491#(= |#race~count1~0| 0), Black: 505#true, Black: 489#true, 473#(= |#race~n1~0| 0)]) [2024-10-11 17:15:10,261 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-10-11 17:15:10,261 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-10-11 17:15:10,262 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2024-10-11 17:15:10,262 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:15:10,268 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2024-10-11 17:15:10,268 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2024-10-11 17:15:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4406 event pairs, 6 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2024-10-11 17:15:10,276 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-10-11 17:15:10,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2024-10-11 17:15:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-10-11 17:15:10,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-10-11 17:15:10,278 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2024-10-11 17:15:10,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2024-10-11 17:15:10,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:10,284 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2024-10-11 17:15:10,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2024-10-11 17:15:10,285 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-10-11 17:15:10,286 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2024-10-11 17:15:10,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:10,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:15:10,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash 436223562, now seen corresponding path program 1 times [2024-10-11 17:15:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649491769] [2024-10-11 17:15:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649491769] [2024-10-11 17:15:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649491769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:15:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035253787] [2024-10-11 17:15:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:10,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-10-11 17:15:10,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:10,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-10-11 17:15:10,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:10,426 INFO L124 PetriNetUnfolderBase]: 81/1037 cut-off events. [2024-10-11 17:15:10,427 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-10-11 17:15:10,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1037 events. 81/1037 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5388 event pairs, 12 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 86 conditions per place. [2024-10-11 17:15:10,435 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2024-10-11 17:15:10,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2024-10-11 17:15:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-10-11 17:15:10,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-10-11 17:15:10,439 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2024-10-11 17:15:10,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2024-10-11 17:15:10,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:10,445 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2024-10-11 17:15:10,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-10-11 17:15:10,446 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-10-11 17:15:10,446 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2024-10-11 17:15:10,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:10,447 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] [2024-10-11 17:15:10,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:15:10,448 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1409788000, now seen corresponding path program 1 times [2024-10-11 17:15:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401133083] [2024-10-11 17:15:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401133083] [2024-10-11 17:15:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401133083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715864914] [2024-10-11 17:15:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:10,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:10,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:10,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:10,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:10,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:10,654 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2024-10-11 17:15:10,655 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-10-11 17:15:10,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7233 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2024-10-11 17:15:10,663 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-10-11 17:15:10,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2024-10-11 17:15:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-10-11 17:15:10,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-10-11 17:15:10,667 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2024-10-11 17:15:10,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2024-10-11 17:15:10,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:10,675 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2024-10-11 17:15:10,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-10-11 17:15:10,676 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2024-10-11 17:15:10,676 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2024-10-11 17:15:10,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:10,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:10,677 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] [2024-10-11 17:15:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:15:10,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash -745107978, now seen corresponding path program 1 times [2024-10-11 17:15:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957377204] [2024-10-11 17:15:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957377204] [2024-10-11 17:15:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957377204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:15:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434061032] [2024-10-11 17:15:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:10,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:15:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:15:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:15:11,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-10-11 17:15:11,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:11,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-10-11 17:15:11,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:11,446 INFO L124 PetriNetUnfolderBase]: 126/2072 cut-off events. [2024-10-11 17:15:11,446 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2024-10-11 17:15:11,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 2072 events. 126/2072 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14236 event pairs, 17 based on Foata normal form. 6/1858 useless extension candidates. Maximal degree in co-relation 2404. Up to 72 conditions per place. [2024-10-11 17:15:11,459 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2024-10-11 17:15:11,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 439 transitions, 1077 flow [2024-10-11 17:15:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:15:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:15:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2024-10-11 17:15:11,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2024-10-11 17:15:11,467 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 12 states and 5200 transitions. [2024-10-11 17:15:11,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 439 transitions, 1077 flow [2024-10-11 17:15:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 439 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:11,473 INFO L231 Difference]: Finished difference. Result has 425 places, 422 transitions, 981 flow [2024-10-11 17:15:11,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=981, PETRI_PLACES=425, PETRI_TRANSITIONS=422} [2024-10-11 17:15:11,474 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-10-11 17:15:11,474 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 422 transitions, 981 flow [2024-10-11 17:15:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:11,475 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] [2024-10-11 17:15:11,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:15:11,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash -315178556, now seen corresponding path program 1 times [2024-10-11 17:15:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693460013] [2024-10-11 17:15:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693460013] [2024-10-11 17:15:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693460013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861587154] [2024-10-11 17:15:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:11,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-10-11 17:15:11,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 422 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:11,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-10-11 17:15:11,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:11,716 INFO L124 PetriNetUnfolderBase]: 147/2144 cut-off events. [2024-10-11 17:15:11,716 INFO L125 PetriNetUnfolderBase]: For 55/59 co-relation queries the response was YES. [2024-10-11 17:15:11,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2144 events. 147/2144 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 14666 event pairs, 12 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 2511. Up to 130 conditions per place. [2024-10-11 17:15:11,733 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-10-11 17:15:11,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 423 transitions, 1022 flow [2024-10-11 17:15:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-10-11 17:15:11,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-10-11 17:15:11,736 INFO L175 Difference]: Start difference. First operand has 425 places, 422 transitions, 981 flow. Second operand 3 states and 1360 transitions. [2024-10-11 17:15:11,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 423 transitions, 1022 flow [2024-10-11 17:15:11,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:11,763 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2024-10-11 17:15:11,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2024-10-11 17:15:11,763 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-10-11 17:15:11,763 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2024-10-11 17:15:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:11,764 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] [2024-10-11 17:15:11,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:15:11,764 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:11,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1348836669, now seen corresponding path program 1 times [2024-10-11 17:15:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:11,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560478632] [2024-10-11 17:15:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560478632] [2024-10-11 17:15:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560478632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116319423] [2024-10-11 17:15:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:11,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:11,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:11,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:11,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][264], [Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 161#L100true, Black: 546#true, 491#(= |#race~count1~0| 0), Black: 489#true, 548#(= |#race~get2~0| 0), 550#true, 473#(= |#race~n1~0| 0), Black: 493#true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 505#true, Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), 520#true, Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|))]) [2024-10-11 17:15:11,957 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-11 17:15:11,957 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-11 17:15:11,957 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-11 17:15:11,957 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-11 17:15:11,962 INFO L124 PetriNetUnfolderBase]: 114/1636 cut-off events. [2024-10-11 17:15:11,962 INFO L125 PetriNetUnfolderBase]: For 56/63 co-relation queries the response was YES. [2024-10-11 17:15:11,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1636 events. 114/1636 cut-off events. For 56/63 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10084 event pairs, 10 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 1952. Up to 96 conditions per place. [2024-10-11 17:15:11,974 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-10-11 17:15:11,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2024-10-11 17:15:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-10-11 17:15:11,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-10-11 17:15:11,977 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2024-10-11 17:15:11,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2024-10-11 17:15:11,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:15:11,983 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2024-10-11 17:15:11,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2024-10-11 17:15:11,984 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-10-11 17:15:11,984 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2024-10-11 17:15:11,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:11,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:11,985 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-10-11 17:15:11,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:15:11,985 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:11,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1660368170, now seen corresponding path program 1 times [2024-10-11 17:15:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982557583] [2024-10-11 17:15:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:11,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982557583] [2024-10-11 17:15:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982557583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:15:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988122454] [2024-10-11 17:15:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:12,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:15:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:15:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:15:12,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-10-11 17:15:12,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:12,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:12,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-10-11 17:15:12,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:12,545 INFO L124 PetriNetUnfolderBase]: 123/1434 cut-off events. [2024-10-11 17:15:12,545 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2024-10-11 17:15:12,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1434 events. 123/1434 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8374 event pairs, 18 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1838. Up to 124 conditions per place. [2024-10-11 17:15:12,556 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 46 selfloop transitions, 20 changer transitions 0/444 dead transitions. [2024-10-11 17:15:12,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 1186 flow [2024-10-11 17:15:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:15:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:15:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5202 transitions. [2024-10-11 17:15:12,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126315789473685 [2024-10-11 17:15:12,563 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 12 states and 5202 transitions. [2024-10-11 17:15:12,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 1186 flow [2024-10-11 17:15:12,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 444 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:12,569 INFO L231 Difference]: Finished difference. Result has 438 places, 425 transitions, 1073 flow [2024-10-11 17:15:12,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=438, PETRI_TRANSITIONS=425} [2024-10-11 17:15:12,570 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 2 predicate places. [2024-10-11 17:15:12,570 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 425 transitions, 1073 flow [2024-10-11 17:15:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:12,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:12,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:12,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:15:12,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:12,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -942378442, now seen corresponding path program 1 times [2024-10-11 17:15:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588279530] [2024-10-11 17:15:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:15:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588279530] [2024-10-11 17:15:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588279530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:15:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079530602] [2024-10-11 17:15:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:12,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:15:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:15:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:15:13,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-10-11 17:15:13,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 425 transitions, 1073 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:13,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:13,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-10-11 17:15:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:13,537 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2024-10-11 17:15:13,537 INFO L125 PetriNetUnfolderBase]: For 255/284 co-relation queries the response was YES. [2024-10-11 17:15:13,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2781 events. 189/2781 cut-off events. For 255/284 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20630 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3671. Up to 129 conditions per place. [2024-10-11 17:15:13,557 INFO L140 encePairwiseOnDemand]: 459/475 looper letters, 50 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2024-10-11 17:15:13,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 450 transitions, 1318 flow [2024-10-11 17:15:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:15:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:15:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2024-10-11 17:15:13,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.911578947368421 [2024-10-11 17:15:13,563 INFO L175 Difference]: Start difference. First operand has 438 places, 425 transitions, 1073 flow. Second operand 11 states and 4763 transitions. [2024-10-11 17:15:13,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 450 transitions, 1318 flow [2024-10-11 17:15:13,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 450 transitions, 1301 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:15:13,570 INFO L231 Difference]: Finished difference. Result has 447 places, 439 transitions, 1210 flow [2024-10-11 17:15:13,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=447, PETRI_TRANSITIONS=439} [2024-10-11 17:15:13,571 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 11 predicate places. [2024-10-11 17:15:13,571 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 439 transitions, 1210 flow [2024-10-11 17:15:13,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:13,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:13,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:13,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:15:13,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1144460950, now seen corresponding path program 1 times [2024-10-11 17:15:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:13,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575741023] [2024-10-11 17:15:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:15:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:13,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575741023] [2024-10-11 17:15:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575741023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:13,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:13,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:15:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666347349] [2024-10-11 17:15:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:13,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:15:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:15:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:15:13,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-10-11 17:15:13,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 439 transitions, 1210 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:13,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:13,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-10-11 17:15:13,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:14,272 INFO L124 PetriNetUnfolderBase]: 162/1951 cut-off events. [2024-10-11 17:15:14,273 INFO L125 PetriNetUnfolderBase]: For 329/334 co-relation queries the response was YES. [2024-10-11 17:15:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1951 events. 162/1951 cut-off events. For 329/334 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12759 event pairs, 25 based on Foata normal form. 8/1815 useless extension candidates. Maximal degree in co-relation 2732. Up to 164 conditions per place. [2024-10-11 17:15:14,288 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 25 changer transitions 0/456 dead transitions. [2024-10-11 17:15:14,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 1425 flow [2024-10-11 17:15:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:15:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:15:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2024-10-11 17:15:14,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9107017543859649 [2024-10-11 17:15:14,296 INFO L175 Difference]: Start difference. First operand has 447 places, 439 transitions, 1210 flow. Second operand 12 states and 5191 transitions. [2024-10-11 17:15:14,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 1425 flow [2024-10-11 17:15:14,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 456 transitions, 1421 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:14,305 INFO L231 Difference]: Finished difference. Result has 461 places, 448 transitions, 1351 flow [2024-10-11 17:15:14,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1351, PETRI_PLACES=461, PETRI_TRANSITIONS=448} [2024-10-11 17:15:14,306 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 25 predicate places. [2024-10-11 17:15:14,306 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 448 transitions, 1351 flow [2024-10-11 17:15:14,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:14,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:15:14,307 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1196552277, now seen corresponding path program 1 times [2024-10-11 17:15:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:14,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584188114] [2024-10-11 17:15:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584188114] [2024-10-11 17:15:14,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584188114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:14,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:14,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:15:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255405531] [2024-10-11 17:15:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:14,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:14,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-10-11 17:15:14,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 448 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:14,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-10-11 17:15:14,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:14,607 INFO L124 PetriNetUnfolderBase]: 145/2656 cut-off events. [2024-10-11 17:15:14,607 INFO L125 PetriNetUnfolderBase]: For 584/591 co-relation queries the response was YES. [2024-10-11 17:15:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 2656 events. 145/2656 cut-off events. For 584/591 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19428 event pairs, 17 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 3601. Up to 77 conditions per place. [2024-10-11 17:15:14,620 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2024-10-11 17:15:14,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 453 transitions, 1398 flow [2024-10-11 17:15:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-10-11 17:15:14,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-10-11 17:15:14,623 INFO L175 Difference]: Start difference. First operand has 461 places, 448 transitions, 1351 flow. Second operand 3 states and 1372 transitions. [2024-10-11 17:15:14,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 453 transitions, 1398 flow [2024-10-11 17:15:14,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 453 transitions, 1381 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:15:14,631 INFO L231 Difference]: Finished difference. Result has 459 places, 450 transitions, 1354 flow [2024-10-11 17:15:14,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=459, PETRI_TRANSITIONS=450} [2024-10-11 17:15:14,631 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 23 predicate places. [2024-10-11 17:15:14,632 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 450 transitions, 1354 flow [2024-10-11 17:15:14,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:14,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:15:14,632 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1331539059, now seen corresponding path program 2 times [2024-10-11 17:15:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292785772] [2024-10-11 17:15:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:14,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292785772] [2024-10-11 17:15:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292785772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:14,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:14,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:15:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063277907] [2024-10-11 17:15:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:14,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-10-11 17:15:14,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 450 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:14,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-10-11 17:15:14,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:14,916 INFO L124 PetriNetUnfolderBase]: 139/2631 cut-off events. [2024-10-11 17:15:14,916 INFO L125 PetriNetUnfolderBase]: For 757/777 co-relation queries the response was YES. [2024-10-11 17:15:14,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 2631 events. 139/2631 cut-off events. For 757/777 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19168 event pairs, 13 based on Foata normal form. 13/2478 useless extension candidates. Maximal degree in co-relation 3720. Up to 72 conditions per place. [2024-10-11 17:15:14,935 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 17 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2024-10-11 17:15:14,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 455 transitions, 1409 flow [2024-10-11 17:15:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-10-11 17:15:14,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-10-11 17:15:14,936 INFO L175 Difference]: Start difference. First operand has 459 places, 450 transitions, 1354 flow. Second operand 3 states and 1372 transitions. [2024-10-11 17:15:14,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 455 transitions, 1409 flow [2024-10-11 17:15:14,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 455 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:14,946 INFO L231 Difference]: Finished difference. Result has 462 places, 452 transitions, 1376 flow [2024-10-11 17:15:14,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1376, PETRI_PLACES=462, PETRI_TRANSITIONS=452} [2024-10-11 17:15:14,947 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 26 predicate places. [2024-10-11 17:15:14,947 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 452 transitions, 1376 flow [2024-10-11 17:15:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:14,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:15:14,948 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 318532884, now seen corresponding path program 1 times [2024-10-11 17:15:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109698351] [2024-10-11 17:15:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:14,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109698351] [2024-10-11 17:15:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109698351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132539757] [2024-10-11 17:15:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:14,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:14,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:14,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:14,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-10-11 17:15:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 452 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:14,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:14,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-10-11 17:15:14,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:15,216 INFO L124 PetriNetUnfolderBase]: 126/2491 cut-off events. [2024-10-11 17:15:15,217 INFO L125 PetriNetUnfolderBase]: For 645/687 co-relation queries the response was YES. [2024-10-11 17:15:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 2491 events. 126/2491 cut-off events. For 645/687 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17794 event pairs, 10 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 3571. Up to 74 conditions per place. [2024-10-11 17:15:15,236 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 12 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2024-10-11 17:15:15,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 449 transitions, 1396 flow [2024-10-11 17:15:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-10-11 17:15:15,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-10-11 17:15:15,238 INFO L175 Difference]: Start difference. First operand has 462 places, 452 transitions, 1376 flow. Second operand 3 states and 1357 transitions. [2024-10-11 17:15:15,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 449 transitions, 1396 flow [2024-10-11 17:15:15,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 449 transitions, 1390 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:15,247 INFO L231 Difference]: Finished difference. Result has 460 places, 449 transitions, 1366 flow [2024-10-11 17:15:15,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=460, PETRI_TRANSITIONS=449} [2024-10-11 17:15:15,248 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 24 predicate places. [2024-10-11 17:15:15,249 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 449 transitions, 1366 flow [2024-10-11 17:15:15,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:15,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:15,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:15,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:15:15,250 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 994397043, now seen corresponding path program 1 times [2024-10-11 17:15:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:15,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648594389] [2024-10-11 17:15:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:15:15,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:15,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648594389] [2024-10-11 17:15:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648594389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229758992] [2024-10-11 17:15:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:15,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:15,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-10-11 17:15:15,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 449 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:15,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:15,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-10-11 17:15:15,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:15,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][272], [Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 553#true, 161#L100true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 582#(<= ~n2~0 0), Black: 583#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 590#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 596#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 608#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 621#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 493#true, Black: 607#(<= ~n2~0 0), Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 631#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 636#true, 520#true, Black: 558#(<= ~n1~0 0)]) [2024-10-11 17:15:15,562 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-10-11 17:15:15,562 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-10-11 17:15:15,562 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-10-11 17:15:15,562 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-10-11 17:15:15,568 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2024-10-11 17:15:15,568 INFO L125 PetriNetUnfolderBase]: For 494/520 co-relation queries the response was YES. [2024-10-11 17:15:15,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 2358 events. 128/2358 cut-off events. For 494/520 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16586 event pairs, 10 based on Foata normal form. 9/2240 useless extension candidates. Maximal degree in co-relation 3303. Up to 99 conditions per place. [2024-10-11 17:15:15,580 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 6 selfloop transitions, 0 changer transitions 87/448 dead transitions. [2024-10-11 17:15:15,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 448 transitions, 1392 flow [2024-10-11 17:15:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:15,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:15,582 INFO L175 Difference]: Start difference. First operand has 460 places, 449 transitions, 1366 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:15,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 448 transitions, 1392 flow [2024-10-11 17:15:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 448 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:15:15,591 INFO L231 Difference]: Finished difference. Result has 458 places, 361 transitions, 945 flow [2024-10-11 17:15:15,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=945, PETRI_PLACES=458, PETRI_TRANSITIONS=361} [2024-10-11 17:15:15,591 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2024-10-11 17:15:15,592 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 361 transitions, 945 flow [2024-10-11 17:15:15,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:15,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:15,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:15,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:15:15,592 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1625429660, now seen corresponding path program 1 times [2024-10-11 17:15:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:15,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097636625] [2024-10-11 17:15:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097636625] [2024-10-11 17:15:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097636625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835016059] [2024-10-11 17:15:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:15,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:16,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-10-11 17:15:16,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 361 transitions, 945 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:16,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:16,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-10-11 17:15:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:16,356 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2024-10-11 17:15:16,356 INFO L125 PetriNetUnfolderBase]: For 287/288 co-relation queries the response was YES. [2024-10-11 17:15:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 1368 events. 85/1368 cut-off events. For 287/288 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8453 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2004. Up to 42 conditions per place. [2024-10-11 17:15:16,367 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2024-10-11 17:15:16,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 364 transitions, 1021 flow [2024-10-11 17:15:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-10-11 17:15:16,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-10-11 17:15:16,370 INFO L175 Difference]: Start difference. First operand has 458 places, 361 transitions, 945 flow. Second operand 6 states and 2637 transitions. [2024-10-11 17:15:16,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 364 transitions, 1021 flow [2024-10-11 17:15:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 364 transitions, 915 flow, removed 22 selfloop flow, removed 28 redundant places. [2024-10-11 17:15:16,377 INFO L231 Difference]: Finished difference. Result has 375 places, 360 transitions, 858 flow [2024-10-11 17:15:16,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=858, PETRI_PLACES=375, PETRI_TRANSITIONS=360} [2024-10-11 17:15:16,378 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-10-11 17:15:16,378 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 360 transitions, 858 flow [2024-10-11 17:15:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:16,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:16,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:15:16,379 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 684140880, now seen corresponding path program 1 times [2024-10-11 17:15:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683938194] [2024-10-11 17:15:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:16,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683938194] [2024-10-11 17:15:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683938194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36804082] [2024-10-11 17:15:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:16,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:17,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-10-11 17:15:17,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 360 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:17,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:17,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-10-11 17:15:17,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:17,170 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2024-10-11 17:15:17,170 INFO L125 PetriNetUnfolderBase]: For 114/117 co-relation queries the response was YES. [2024-10-11 17:15:17,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1146 events. 89/1146 cut-off events. For 114/117 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6527 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1529. Up to 66 conditions per place. [2024-10-11 17:15:17,177 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2024-10-11 17:15:17,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 363 transitions, 930 flow [2024-10-11 17:15:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-10-11 17:15:17,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-10-11 17:15:17,180 INFO L175 Difference]: Start difference. First operand has 375 places, 360 transitions, 858 flow. Second operand 6 states and 2637 transitions. [2024-10-11 17:15:17,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 363 transitions, 930 flow [2024-10-11 17:15:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 363 transitions, 921 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:15:17,185 INFO L231 Difference]: Finished difference. Result has 375 places, 359 transitions, 864 flow [2024-10-11 17:15:17,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=375, PETRI_TRANSITIONS=359} [2024-10-11 17:15:17,186 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-10-11 17:15:17,186 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 359 transitions, 864 flow [2024-10-11 17:15:17,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:17,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:17,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:17,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:15:17,187 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:17,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2045752898, now seen corresponding path program 1 times [2024-10-11 17:15:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769320871] [2024-10-11 17:15:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769320871] [2024-10-11 17:15:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769320871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796245934] [2024-10-11 17:15:17,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:17,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:17,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-10-11 17:15:17,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 359 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:17,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:17,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-10-11 17:15:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:17,962 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2024-10-11 17:15:17,962 INFO L125 PetriNetUnfolderBase]: For 110/111 co-relation queries the response was YES. [2024-10-11 17:15:17,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1333 events. 79/1333 cut-off events. For 110/111 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8016 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1756. Up to 42 conditions per place. [2024-10-11 17:15:17,971 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2024-10-11 17:15:17,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 361 transitions, 934 flow [2024-10-11 17:15:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-10-11 17:15:17,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-10-11 17:15:17,973 INFO L175 Difference]: Start difference. First operand has 375 places, 359 transitions, 864 flow. Second operand 6 states and 2637 transitions. [2024-10-11 17:15:17,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 361 transitions, 934 flow [2024-10-11 17:15:17,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 361 transitions, 925 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:15:17,980 INFO L231 Difference]: Finished difference. Result has 374 places, 357 transitions, 863 flow [2024-10-11 17:15:17,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=374, PETRI_TRANSITIONS=357} [2024-10-11 17:15:17,981 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2024-10-11 17:15:17,981 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 357 transitions, 863 flow [2024-10-11 17:15:17,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:17,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:15:17,982 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:17,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1744380554, now seen corresponding path program 1 times [2024-10-11 17:15:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:17,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078751678] [2024-10-11 17:15:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078751678] [2024-10-11 17:15:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078751678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:18,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:18,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:15:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176867342] [2024-10-11 17:15:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:15:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:18,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:15:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:15:18,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-10-11 17:15:18,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 357 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:18,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:18,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-10-11 17:15:18,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:18,719 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2024-10-11 17:15:18,720 INFO L125 PetriNetUnfolderBase]: For 136/139 co-relation queries the response was YES. [2024-10-11 17:15:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1120 events. 84/1120 cut-off events. For 136/139 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6159 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1509. Up to 61 conditions per place. [2024-10-11 17:15:18,727 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2024-10-11 17:15:18,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 359 transitions, 933 flow [2024-10-11 17:15:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:15:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:15:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-10-11 17:15:18,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-10-11 17:15:18,729 INFO L175 Difference]: Start difference. First operand has 374 places, 357 transitions, 863 flow. Second operand 6 states and 2637 transitions. [2024-10-11 17:15:18,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 359 transitions, 933 flow [2024-10-11 17:15:18,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 359 transitions, 921 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:18,735 INFO L231 Difference]: Finished difference. Result has 372 places, 355 transitions, 859 flow [2024-10-11 17:15:18,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=372, PETRI_TRANSITIONS=355} [2024-10-11 17:15:18,737 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -64 predicate places. [2024-10-11 17:15:18,737 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 355 transitions, 859 flow [2024-10-11 17:15:18,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:18,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:18,738 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:15:18,739 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:18,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1514730149, now seen corresponding path program 1 times [2024-10-11 17:15:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660282890] [2024-10-11 17:15:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660282890] [2024-10-11 17:15:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660282890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777135108] [2024-10-11 17:15:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:18,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:18,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:18,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 355 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:18,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:18,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:18,904 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2024-10-11 17:15:18,904 INFO L125 PetriNetUnfolderBase]: For 100/103 co-relation queries the response was YES. [2024-10-11 17:15:18,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 1173 events. 66/1173 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6293 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1499. Up to 36 conditions per place. [2024-10-11 17:15:18,911 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-10-11 17:15:18,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 355 transitions, 878 flow [2024-10-11 17:15:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-10-11 17:15:18,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-10-11 17:15:18,913 INFO L175 Difference]: Start difference. First operand has 372 places, 355 transitions, 859 flow. Second operand 3 states and 1357 transitions. [2024-10-11 17:15:18,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 355 transitions, 878 flow [2024-10-11 17:15:18,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 355 transitions, 866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:15:18,918 INFO L231 Difference]: Finished difference. Result has 368 places, 354 transitions, 849 flow [2024-10-11 17:15:18,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=368, PETRI_TRANSITIONS=354} [2024-10-11 17:15:18,919 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -68 predicate places. [2024-10-11 17:15:18,919 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 354 transitions, 849 flow [2024-10-11 17:15:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:18,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:15:18,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:18,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:15:18,920 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-10-11 17:15:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:15:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1215982408, now seen corresponding path program 1 times [2024-10-11 17:15:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:15:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183588075] [2024-10-11 17:15:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:15:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:15:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:15:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:15:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:15:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183588075] [2024-10-11 17:15:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183588075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:15:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:15:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:15:18,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455038143] [2024-10-11 17:15:18,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:15:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:15:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:15:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:15:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:15:18,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-10-11 17:15:18,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 354 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:18,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:15:18,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-10-11 17:15:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:15:19,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1225] L77-6-->L77-7: Formula: (= |v_#race~res2~0_7| |v_thread2Thread1of1ForFork1_#t~nondet17_3|) InVars {thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} OutVars{#race~res2~0=|v_#race~res2~0_7|, thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} AuxVars[] AssignedVars[#race~res2~0][264], [308#L77-7true, 553#true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, Black: 647#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 671#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), Black: 654#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 668#true, Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, 36#L99-1true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 493#true, Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 631#true, Black: 505#true, 520#true]) [2024-10-11 17:15:19,067 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2024-10-11 17:15:19,067 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-10-11 17:15:19,067 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-10-11 17:15:19,067 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-10-11 17:15:19,067 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2024-10-11 17:15:19,067 INFO L125 PetriNetUnfolderBase]: For 81/84 co-relation queries the response was YES. [2024-10-11 17:15:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1014 events. 65/1014 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4974 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1286. Up to 44 conditions per place. [2024-10-11 17:15:19,073 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2024-10-11 17:15:19,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 354 transitions, 870 flow [2024-10-11 17:15:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:15:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:15:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-10-11 17:15:19,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-10-11 17:15:19,074 INFO L175 Difference]: Start difference. First operand has 368 places, 354 transitions, 849 flow. Second operand 3 states and 1358 transitions. [2024-10-11 17:15:19,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 354 transitions, 870 flow [2024-10-11 17:15:19,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 354 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:15:19,078 INFO L231 Difference]: Finished difference. Result has 367 places, 0 transitions, 0 flow [2024-10-11 17:15:19,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=367, PETRI_TRANSITIONS=0} [2024-10-11 17:15:19,078 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2024-10-11 17:15:19,078 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 0 transitions, 0 flow [2024-10-11 17:15:19,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-10-11 17:15:19,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-10-11 17:15:19,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-10-11 17:15:19,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2024-10-11 17:15:19,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-10-11 17:15:19,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-10-11 17:15:19,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-10-11 17:15:19,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-10-11 17:15:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:15:19,087 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:15:19,093 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:15:19,093 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:15:19,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:15:19 BasicIcfg [2024-10-11 17:15:19,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:15:19,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:15:19,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:15:19,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:15:19,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:15:05" (3/4) ... [2024-10-11 17:15:19,101 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:15:19,103 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:15:19,103 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:15:19,110 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 17:15:19,110 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:15:19,110 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:15:19,110 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:15:19,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:15:19,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:15:19,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:15:19,195 INFO L158 Benchmark]: Toolchain (without parser) took 14345.10ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 73.1MB in the beginning and 430.4MB in the end (delta: -357.3MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,196 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 105.8MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:15:19,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.79ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 58.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.25ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 55.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,196 INFO L158 Benchmark]: Boogie Preprocessor took 50.42ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 55.9MB in the beginning and 165.8MB in the end (delta: -109.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,196 INFO L158 Benchmark]: RCFGBuilder took 755.11ms. Allocated memory is still 197.1MB. Free memory was 165.7MB in the beginning and 131.5MB in the end (delta: 34.2MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,197 INFO L158 Benchmark]: TraceAbstraction took 13109.05ms. Allocated memory was 197.1MB in the beginning and 595.6MB in the end (delta: 398.5MB). Free memory was 130.5MB in the beginning and 437.7MB in the end (delta: -307.2MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,197 INFO L158 Benchmark]: Witness Printer took 95.97ms. Allocated memory is still 595.6MB. Free memory was 437.7MB in the beginning and 430.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:15:19,198 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.13ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 105.8MB in the end (delta: 174.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.79ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 58.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.25ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 55.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.42ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 55.9MB in the beginning and 165.8MB in the end (delta: -109.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * RCFGBuilder took 755.11ms. Allocated memory is still 197.1MB. Free memory was 165.7MB in the beginning and 131.5MB in the end (delta: 34.2MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13109.05ms. Allocated memory was 197.1MB in the beginning and 595.6MB in the end (delta: 398.5MB). Free memory was 130.5MB in the beginning and 437.7MB in the end (delta: -307.2MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 95.97ms. Allocated memory is still 595.6MB. Free memory was 437.7MB in the beginning and 430.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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: 69]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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 - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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 5 procedures, 668 locations, 94 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: 13.0s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3927 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2403 mSDsluCounter, 3844 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5616 IncrementalHoareTripleChecker+Invalid, 6252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 256 mSDtfsCounter, 5616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1376occurred in iteration=25, InterpolantAutomatonStates: 149, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4403 ConstructedInterpolants, 0 QuantifiedInterpolants, 5757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 14/14 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:15:19,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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