./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/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:01:34,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:01:34,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:01:34,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:01:34,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:01:34,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:01:34,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:01:34,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:01:34,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:01:34,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:01:34,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:01:34,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:01:34,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:01:34,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:01:34,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:01:34,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:01:34,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:01:34,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:01:34,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:01:34,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:01:34,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:01:34,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:01:34,201 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:01:34,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:01:34,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:01:34,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:01:34,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:01:34,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:01:34,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:01:34,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:01:34,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:01:34,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:34,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:01:34,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:01:34,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:01:34,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:01:34,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:01:34,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:01:34,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:01:34,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:01:34,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:01:34,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-10-13 10:01:34,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:01:34,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:01:34,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:01:34,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:01:34,520 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:01:34,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 10:01:35,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:01:36,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:01:36,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-10-13 10:01:36,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426e6f3c/f78a54b8df5e4be78571d6f28de44c05/FLAGb4efd9217 [2024-10-13 10:01:36,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5426e6f3c/f78a54b8df5e4be78571d6f28de44c05 [2024-10-13 10:01:36,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:01:36,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:01:36,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:36,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:01:36,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:01:36,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281aeb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36, skipping insertion in model container [2024-10-13 10:01:36,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:01:36,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:36,660 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:01:36,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:36,763 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:01:36,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36 WrapperNode [2024-10-13 10:01:36,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:36,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:36,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:01:36,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:01:36,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,819 INFO L138 Inliner]: procedures = 168, calls = 30, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 225 [2024-10-13 10:01:36,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:36,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:01:36,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:01:36,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:01:36,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:01:36,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:01:36,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:01:36,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:01:36,870 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (1/1) ... [2024-10-13 10:01:36,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:36,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:01:36,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:01:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:01:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-13 10:01:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-13 10:01:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:01:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 10:01:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:01:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:01:36,955 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:01:37,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:01:37,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:01:37,531 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:01:37,531 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:01:37,561 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:01:37,562 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:01:37,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:37 BoogieIcfgContainer [2024-10-13 10:01:37,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:01:37,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:01:37,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:01:37,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:01:37,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:01:36" (1/3) ... [2024-10-13 10:01:37,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2588fd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:37, skipping insertion in model container [2024-10-13 10:01:37,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:36" (2/3) ... [2024-10-13 10:01:37,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2588fd74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:37, skipping insertion in model container [2024-10-13 10:01:37,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:37" (3/3) ... [2024-10-13 10:01:37,576 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-10-13 10:01:37,589 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:01:37,590 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-13 10:01:37,590 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:01:37,693 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 10:01:37,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 268 transitions, 550 flow [2024-10-13 10:01:37,876 INFO L124 PetriNetUnfolderBase]: 14/266 cut-off events. [2024-10-13 10:01:37,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:01:37,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 266 events. 14/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 647 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2024-10-13 10:01:37,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 268 transitions, 550 flow [2024-10-13 10:01:37,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 261 transitions, 531 flow [2024-10-13 10:01:37,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:01:37,918 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;@629e7802, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:01:37,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-10-13 10:01:37,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:01:37,932 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-10-13 10:01:37,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:01:37,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:37,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:37,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -470963714, now seen corresponding path program 1 times [2024-10-13 10:01:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:37,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553039164] [2024-10-13 10:01:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:38,207 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-13 10:01:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553039164] [2024-10-13 10:01:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553039164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:38,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:38,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705075518] [2024-10-13 10:01:38,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:38,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:38,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-10-13 10:01:38,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 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-13 10:01:38,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:38,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-10-13 10:01:38,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:38,480 INFO L124 PetriNetUnfolderBase]: 55/636 cut-off events. [2024-10-13 10:01:38,480 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-13 10:01:38,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 636 events. 55/636 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3346 event pairs, 27 based on Foata normal form. 34/557 useless extension candidates. Maximal degree in co-relation 630. Up to 79 conditions per place. [2024-10-13 10:01:38,494 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 16 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-10-13 10:01:38,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 250 transitions, 545 flow [2024-10-13 10:01:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-10-13 10:01:38,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9266169154228856 [2024-10-13 10:01:38,516 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 531 flow. Second operand 3 states and 745 transitions. [2024-10-13 10:01:38,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 250 transitions, 545 flow [2024-10-13 10:01:38,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 250 transitions, 540 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 10:01:38,527 INFO L231 Difference]: Finished difference. Result has 248 places, 250 transitions, 508 flow [2024-10-13 10:01:38,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=248, PETRI_TRANSITIONS=250} [2024-10-13 10:01:38,533 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -6 predicate places. [2024-10-13 10:01:38,535 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 250 transitions, 508 flow [2024-10-13 10:01:38,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 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-13 10:01:38,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:38,536 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] [2024-10-13 10:01:38,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:01:38,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:38,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1131995633, now seen corresponding path program 1 times [2024-10-13 10:01:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:38,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472516549] [2024-10-13 10:01:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:38,639 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-13 10:01:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472516549] [2024-10-13 10:01:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472516549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:38,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174564581] [2024-10-13 10:01:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:38,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:38,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:38,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-10-13 10:01:38,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 250 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 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-13 10:01:38,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:38,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-10-13 10:01:38,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:38,816 INFO L124 PetriNetUnfolderBase]: 59/639 cut-off events. [2024-10-13 10:01:38,816 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 10:01:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 639 events. 59/639 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3430 event pairs, 31 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 707. Up to 89 conditions per place. [2024-10-13 10:01:38,823 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 18 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-10-13 10:01:38,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 249 transitions, 546 flow [2024-10-13 10:01:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2024-10-13 10:01:38,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.914179104477612 [2024-10-13 10:01:38,829 INFO L175 Difference]: Start difference. First operand has 248 places, 250 transitions, 508 flow. Second operand 3 states and 735 transitions. [2024-10-13 10:01:38,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 249 transitions, 546 flow [2024-10-13 10:01:38,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 249 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:38,836 INFO L231 Difference]: Finished difference. Result has 247 places, 249 transitions, 506 flow [2024-10-13 10:01:38,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=247, PETRI_TRANSITIONS=249} [2024-10-13 10:01:38,837 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -7 predicate places. [2024-10-13 10:01:38,837 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 249 transitions, 506 flow [2024-10-13 10:01:38,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 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-13 10:01:38,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:38,840 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] [2024-10-13 10:01:38,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:01:38,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1221061866, now seen corresponding path program 1 times [2024-10-13 10:01:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:38,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361746260] [2024-10-13 10:01:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:38,943 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-13 10:01:38,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:38,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361746260] [2024-10-13 10:01:38,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361746260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:38,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:38,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26482265] [2024-10-13 10:01:38,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:38,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:38,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:38,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 268 [2024-10-13 10:01:39,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 249 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-13 10:01:39,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 268 [2024-10-13 10:01:39,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:39,222 INFO L124 PetriNetUnfolderBase]: 125/1209 cut-off events. [2024-10-13 10:01:39,222 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-13 10:01:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1209 events. 125/1209 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7688 event pairs, 54 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1372. Up to 170 conditions per place. [2024-10-13 10:01:39,232 INFO L140 encePairwiseOnDemand]: 257/268 looper letters, 23 selfloop transitions, 5 changer transitions 0/250 dead transitions. [2024-10-13 10:01:39,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 250 transitions, 566 flow [2024-10-13 10:01:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-10-13 10:01:39,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079601990049752 [2024-10-13 10:01:39,236 INFO L175 Difference]: Start difference. First operand has 247 places, 249 transitions, 506 flow. Second operand 3 states and 730 transitions. [2024-10-13 10:01:39,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 250 transitions, 566 flow [2024-10-13 10:01:39,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 250 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:39,241 INFO L231 Difference]: Finished difference. Result has 244 places, 247 transitions, 526 flow [2024-10-13 10:01:39,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=244, PETRI_TRANSITIONS=247} [2024-10-13 10:01:39,243 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -10 predicate places. [2024-10-13 10:01:39,243 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 247 transitions, 526 flow [2024-10-13 10:01:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-13 10:01:39,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:39,244 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-13 10:01:39,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:01:39,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:39,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1766490917, now seen corresponding path program 1 times [2024-10-13 10:01:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107351720] [2024-10-13 10:01:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:39,313 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-13 10:01:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107351720] [2024-10-13 10:01:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107351720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193030183] [2024-10-13 10:01:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:39,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:39,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 268 [2024-10-13 10:01:39,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-13 10:01:39,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 268 [2024-10-13 10:01:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:39,472 INFO L124 PetriNetUnfolderBase]: 79/1069 cut-off events. [2024-10-13 10:01:39,473 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-13 10:01:39,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1069 events. 79/1069 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6072 event pairs, 24 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1038. Up to 82 conditions per place. [2024-10-13 10:01:39,481 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 15 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-10-13 10:01:39,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 246 transitions, 558 flow [2024-10-13 10:01:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2024-10-13 10:01:39,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216417910447762 [2024-10-13 10:01:39,484 INFO L175 Difference]: Start difference. First operand has 244 places, 247 transitions, 526 flow. Second operand 3 states and 741 transitions. [2024-10-13 10:01:39,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 246 transitions, 558 flow [2024-10-13 10:01:39,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 246 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:39,491 INFO L231 Difference]: Finished difference. Result has 243 places, 246 transitions, 518 flow [2024-10-13 10:01:39,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=243, PETRI_TRANSITIONS=246} [2024-10-13 10:01:39,492 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -11 predicate places. [2024-10-13 10:01:39,492 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 246 transitions, 518 flow [2024-10-13 10:01:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-13 10:01:39,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:39,493 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] [2024-10-13 10:01:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:01:39,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -310138384, now seen corresponding path program 1 times [2024-10-13 10:01:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129922539] [2024-10-13 10:01:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:39,531 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-13 10:01:39,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:39,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129922539] [2024-10-13 10:01:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129922539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430092560] [2024-10-13 10:01:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-10-13 10:01:39,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 246 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-13 10:01:39,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-10-13 10:01:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:39,668 INFO L124 PetriNetUnfolderBase]: 63/830 cut-off events. [2024-10-13 10:01:39,669 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 10:01:39,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 830 events. 63/830 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3994 event pairs, 22 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 887. Up to 69 conditions per place. [2024-10-13 10:01:39,674 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 13 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-10-13 10:01:39,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 245 transitions, 546 flow [2024-10-13 10:01:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-10-13 10:01:39,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2024-10-13 10:01:39,677 INFO L175 Difference]: Start difference. First operand has 243 places, 246 transitions, 518 flow. Second operand 3 states and 742 transitions. [2024-10-13 10:01:39,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 245 transitions, 546 flow [2024-10-13 10:01:39,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 245 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:39,681 INFO L231 Difference]: Finished difference. Result has 242 places, 245 transitions, 516 flow [2024-10-13 10:01:39,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=242, PETRI_TRANSITIONS=245} [2024-10-13 10:01:39,682 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -12 predicate places. [2024-10-13 10:01:39,682 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 245 transitions, 516 flow [2024-10-13 10:01:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-13 10:01:39,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:39,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:39,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:01:39,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:39,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash 593958672, now seen corresponding path program 1 times [2024-10-13 10:01:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:39,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33507194] [2024-10-13 10:01:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:39,744 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-13 10:01:39,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33507194] [2024-10-13 10:01:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33507194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:39,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:39,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475685833] [2024-10-13 10:01:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:39,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-10-13 10:01:39,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 245 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-13 10:01:39,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-10-13 10:01:39,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:39,876 INFO L124 PetriNetUnfolderBase]: 68/909 cut-off events. [2024-10-13 10:01:39,876 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 10:01:39,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 909 events. 68/909 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4622 event pairs, 22 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 961. Up to 71 conditions per place. [2024-10-13 10:01:39,883 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 13 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-13 10:01:39,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 244 transitions, 544 flow [2024-10-13 10:01:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-10-13 10:01:39,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2024-10-13 10:01:39,885 INFO L175 Difference]: Start difference. First operand has 242 places, 245 transitions, 516 flow. Second operand 3 states and 742 transitions. [2024-10-13 10:01:39,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 244 transitions, 544 flow [2024-10-13 10:01:39,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 244 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:39,890 INFO L231 Difference]: Finished difference. Result has 241 places, 244 transitions, 514 flow [2024-10-13 10:01:39,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=241, PETRI_TRANSITIONS=244} [2024-10-13 10:01:39,891 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -13 predicate places. [2024-10-13 10:01:39,891 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 244 transitions, 514 flow [2024-10-13 10:01:39,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-13 10:01:39,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:39,892 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] [2024-10-13 10:01:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:01:39,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:39,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1881069647, now seen corresponding path program 1 times [2024-10-13 10:01:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451767158] [2024-10-13 10:01:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:39,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:39,948 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-13 10:01:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451767158] [2024-10-13 10:01:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451767158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910260978] [2024-10-13 10:01:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:39,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-10-13 10:01:39,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 244 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 10:01:39,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-10-13 10:01:39,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:40,145 INFO L124 PetriNetUnfolderBase]: 110/1242 cut-off events. [2024-10-13 10:01:40,145 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-13 10:01:40,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 1242 events. 110/1242 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7229 event pairs, 20 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1378. Up to 87 conditions per place. [2024-10-13 10:01:40,152 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 19 selfloop transitions, 4 changer transitions 0/254 dead transitions. [2024-10-13 10:01:40,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 254 transitions, 583 flow [2024-10-13 10:01:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-10-13 10:01:40,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9477611940298507 [2024-10-13 10:01:40,155 INFO L175 Difference]: Start difference. First operand has 241 places, 244 transitions, 514 flow. Second operand 3 states and 762 transitions. [2024-10-13 10:01:40,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 254 transitions, 583 flow [2024-10-13 10:01:40,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 254 transitions, 579 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:40,160 INFO L231 Difference]: Finished difference. Result has 243 places, 248 transitions, 544 flow [2024-10-13 10:01:40,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=243, PETRI_TRANSITIONS=248} [2024-10-13 10:01:40,161 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -11 predicate places. [2024-10-13 10:01:40,161 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 248 transitions, 544 flow [2024-10-13 10:01:40,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 10:01:40,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:40,162 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] [2024-10-13 10:01:40,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:01:40,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:40,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 368633009, now seen corresponding path program 1 times [2024-10-13 10:01:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196055316] [2024-10-13 10:01:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:40,211 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-13 10:01:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196055316] [2024-10-13 10:01:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196055316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906359278] [2024-10-13 10:01:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:40,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:40,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-10-13 10:01:40,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 248 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 10:01:40,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:40,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-10-13 10:01:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:40,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][237], [72#L762-4true, 289#true, Black: 270#true, 262#true, 250#L750-2true, 210#L726-3true, 284#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:40,441 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 10:01:40,442 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 10:01:40,442 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-13 10:01:40,442 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-13 10:01:40,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][237], [289#true, Black: 270#true, 132#L763-1true, 262#true, 250#L750-2true, 284#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:40,448 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 10:01:40,448 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-13 10:01:40,448 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-13 10:01:40,448 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 10:01:40,495 INFO L124 PetriNetUnfolderBase]: 217/2252 cut-off events. [2024-10-13 10:01:40,496 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-13 10:01:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2252 events. 217/2252 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16417 event pairs, 41 based on Foata normal form. 0/1891 useless extension candidates. Maximal degree in co-relation 2483. Up to 161 conditions per place. [2024-10-13 10:01:40,514 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 18 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2024-10-13 10:01:40,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 257 transitions, 607 flow [2024-10-13 10:01:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2024-10-13 10:01:40,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9465174129353234 [2024-10-13 10:01:40,516 INFO L175 Difference]: Start difference. First operand has 243 places, 248 transitions, 544 flow. Second operand 3 states and 761 transitions. [2024-10-13 10:01:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 257 transitions, 607 flow [2024-10-13 10:01:40,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 257 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:40,553 INFO L231 Difference]: Finished difference. Result has 245 places, 252 transitions, 570 flow [2024-10-13 10:01:40,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=245, PETRI_TRANSITIONS=252} [2024-10-13 10:01:40,555 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -9 predicate places. [2024-10-13 10:01:40,555 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 252 transitions, 570 flow [2024-10-13 10:01:40,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 10:01:40,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:40,556 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] [2024-10-13 10:01:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:01:40,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2104279225, now seen corresponding path program 1 times [2024-10-13 10:01:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752632973] [2024-10-13 10:01:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:40,644 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-13 10:01:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752632973] [2024-10-13 10:01:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752632973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763845192] [2024-10-13 10:01:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:40,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 268 [2024-10-13 10:01:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 252 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-13 10:01:40,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:40,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 268 [2024-10-13 10:01:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:41,242 INFO L124 PetriNetUnfolderBase]: 464/4086 cut-off events. [2024-10-13 10:01:41,244 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-10-13 10:01:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 4086 events. 464/4086 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 38293 event pairs, 115 based on Foata normal form. 0/3521 useless extension candidates. Maximal degree in co-relation 4787. Up to 523 conditions per place. [2024-10-13 10:01:41,273 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 24 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-10-13 10:01:41,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 255 transitions, 631 flow [2024-10-13 10:01:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2024-10-13 10:01:41,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191542288557214 [2024-10-13 10:01:41,276 INFO L175 Difference]: Start difference. First operand has 245 places, 252 transitions, 570 flow. Second operand 3 states and 739 transitions. [2024-10-13 10:01:41,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 255 transitions, 631 flow [2024-10-13 10:01:41,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 255 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:41,284 INFO L231 Difference]: Finished difference. Result has 241 places, 249 transitions, 566 flow [2024-10-13 10:01:41,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=241, PETRI_TRANSITIONS=249} [2024-10-13 10:01:41,286 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -13 predicate places. [2024-10-13 10:01:41,286 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 249 transitions, 566 flow [2024-10-13 10:01:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 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-13 10:01:41,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:41,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] [2024-10-13 10:01:41,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:01:41,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:41,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash -103334104, now seen corresponding path program 1 times [2024-10-13 10:01:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336210075] [2024-10-13 10:01:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:41,365 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-13 10:01:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336210075] [2024-10-13 10:01:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336210075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:41,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722066576] [2024-10-13 10:01:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:41,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:41,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 268 [2024-10-13 10:01:41,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 249 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-13 10:01:41,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:41,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 268 [2024-10-13 10:01:41,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:42,049 INFO L124 PetriNetUnfolderBase]: 668/5204 cut-off events. [2024-10-13 10:01:42,050 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-10-13 10:01:42,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6677 conditions, 5204 events. 668/5204 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 49766 event pairs, 119 based on Foata normal form. 0/4594 useless extension candidates. Maximal degree in co-relation 6429. Up to 598 conditions per place. [2024-10-13 10:01:42,094 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 18 selfloop transitions, 4 changer transitions 0/253 dead transitions. [2024-10-13 10:01:42,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 253 transitions, 619 flow [2024-10-13 10:01:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-13 10:01:42,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2024-10-13 10:01:42,097 INFO L175 Difference]: Start difference. First operand has 241 places, 249 transitions, 566 flow. Second operand 3 states and 748 transitions. [2024-10-13 10:01:42,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 253 transitions, 619 flow [2024-10-13 10:01:42,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 619 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:42,104 INFO L231 Difference]: Finished difference. Result has 241 places, 248 transitions, 580 flow [2024-10-13 10:01:42,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=241, PETRI_TRANSITIONS=248} [2024-10-13 10:01:42,106 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -13 predicate places. [2024-10-13 10:01:42,107 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 248 transitions, 580 flow [2024-10-13 10:01:42,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-13 10:01:42,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:42,110 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] [2024-10-13 10:01:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:01:42,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:42,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1574913525, now seen corresponding path program 1 times [2024-10-13 10:01:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172506112] [2024-10-13 10:01:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:42,173 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-13 10:01:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172506112] [2024-10-13 10:01:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172506112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:42,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:01:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72773325] [2024-10-13 10:01:42,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:42,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:42,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:42,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-10-13 10:01:42,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 248 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-13 10:01:42,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:42,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-10-13 10:01:42,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:42,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [72#L762-4true, Black: 270#true, Black: 291#(= |#race~receive~0| 0), 262#true, 302#true, 250#L750-2true, 210#L726-3true, Black: 294#true, 300#(= |#race~first~0| 0), 296#(= |#race~buffer_size~0| 0), Black: 298#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:42,734 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:42,734 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:42,734 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:42,734 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:42,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 270#true, 132#L763-1true, Black: 291#(= |#race~receive~0| 0), 262#true, 302#true, 250#L750-2true, Black: 294#true, 300#(= |#race~first~0| 0), 296#(= |#race~buffer_size~0| 0), Black: 298#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:42,755 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:42,755 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:42,755 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:42,755 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:42,827 INFO L124 PetriNetUnfolderBase]: 685/4841 cut-off events. [2024-10-13 10:01:42,828 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-13 10:01:42,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6503 conditions, 4841 events. 685/4841 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 45001 event pairs, 291 based on Foata normal form. 0/4240 useless extension candidates. Maximal degree in co-relation 6198. Up to 816 conditions per place. [2024-10-13 10:01:42,859 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 18 selfloop transitions, 3 changer transitions 0/252 dead transitions. [2024-10-13 10:01:42,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 252 transitions, 632 flow [2024-10-13 10:01:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-13 10:01:42,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2024-10-13 10:01:42,862 INFO L175 Difference]: Start difference. First operand has 241 places, 248 transitions, 580 flow. Second operand 3 states and 748 transitions. [2024-10-13 10:01:42,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 252 transitions, 632 flow [2024-10-13 10:01:42,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 252 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:42,867 INFO L231 Difference]: Finished difference. Result has 244 places, 249 transitions, 594 flow [2024-10-13 10:01:42,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=244, PETRI_TRANSITIONS=249} [2024-10-13 10:01:42,868 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -10 predicate places. [2024-10-13 10:01:42,868 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 249 transitions, 594 flow [2024-10-13 10:01:42,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-13 10:01:42,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:42,869 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 10:01:42,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:01:42,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1126873029, now seen corresponding path program 1 times [2024-10-13 10:01:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289051248] [2024-10-13 10:01:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:42,910 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-13 10:01:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289051248] [2024-10-13 10:01:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289051248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:01:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681520206] [2024-10-13 10:01:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:42,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:42,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-10-13 10:01:42,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 249 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-13 10:01:42,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:42,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-10-13 10:01:42,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:43,684 INFO L124 PetriNetUnfolderBase]: 734/5372 cut-off events. [2024-10-13 10:01:43,684 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-10-13 10:01:43,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7376 conditions, 5372 events. 734/5372 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 51015 event pairs, 298 based on Foata normal form. 0/4764 useless extension candidates. Maximal degree in co-relation 7117. Up to 917 conditions per place. [2024-10-13 10:01:43,723 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 18 selfloop transitions, 3 changer transitions 0/252 dead transitions. [2024-10-13 10:01:43,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 252 transitions, 641 flow [2024-10-13 10:01:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-13 10:01:43,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2024-10-13 10:01:43,726 INFO L175 Difference]: Start difference. First operand has 244 places, 249 transitions, 594 flow. Second operand 3 states and 748 transitions. [2024-10-13 10:01:43,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 252 transitions, 641 flow [2024-10-13 10:01:43,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 252 transitions, 633 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:43,733 INFO L231 Difference]: Finished difference. Result has 246 places, 249 transitions, 600 flow [2024-10-13 10:01:43,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=246, PETRI_TRANSITIONS=249} [2024-10-13 10:01:43,735 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -8 predicate places. [2024-10-13 10:01:43,735 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 249 transitions, 600 flow [2024-10-13 10:01:43,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-13 10:01:43,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:43,736 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] [2024-10-13 10:01:43,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:01:43,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 439153578, now seen corresponding path program 1 times [2024-10-13 10:01:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539110734] [2024-10-13 10:01:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:43,928 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-13 10:01:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539110734] [2024-10-13 10:01:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539110734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:43,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577069655] [2024-10-13 10:01:43,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:43,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:43,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:43,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-10-13 10:01:43,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 249 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-13 10:01:43,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:43,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-10-13 10:01:43,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:44,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [72#L762-4true, Black: 291#(= |#race~receive~0| 0), 262#true, 312#true, 210#L726-3true, Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 296#(= |#race~buffer_size~0| 0), 307#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:44,410 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:44,411 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:44,411 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:44,411 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:44,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [132#L763-1true, Black: 291#(= |#race~receive~0| 0), 262#true, 312#true, Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 296#(= |#race~buffer_size~0| 0), 307#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:44,434 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:44,434 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:44,434 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:44,434 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:44,541 INFO L124 PetriNetUnfolderBase]: 614/4658 cut-off events. [2024-10-13 10:01:44,541 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2024-10-13 10:01:44,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6390 conditions, 4658 events. 614/4658 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 43362 event pairs, 243 based on Foata normal form. 0/4162 useless extension candidates. Maximal degree in co-relation 6091. Up to 707 conditions per place. [2024-10-13 10:01:44,583 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 21 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2024-10-13 10:01:44,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 255 transitions, 664 flow [2024-10-13 10:01:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-13 10:01:44,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927860696517413 [2024-10-13 10:01:44,586 INFO L175 Difference]: Start difference. First operand has 246 places, 249 transitions, 600 flow. Second operand 3 states and 746 transitions. [2024-10-13 10:01:44,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 255 transitions, 664 flow [2024-10-13 10:01:44,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 255 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:44,593 INFO L231 Difference]: Finished difference. Result has 248 places, 252 transitions, 624 flow [2024-10-13 10:01:44,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=248, PETRI_TRANSITIONS=252} [2024-10-13 10:01:44,594 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -6 predicate places. [2024-10-13 10:01:44,595 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 252 transitions, 624 flow [2024-10-13 10:01:44,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-13 10:01:44,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:44,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:44,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:01:44,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:44,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -181945702, now seen corresponding path program 1 times [2024-10-13 10:01:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391169208] [2024-10-13 10:01:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391169208] [2024-10-13 10:01:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391169208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129651138] [2024-10-13 10:01:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:44,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 268 [2024-10-13 10:01:44,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 252 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 10:01:44,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:44,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 268 [2024-10-13 10:01:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:45,159 INFO L124 PetriNetUnfolderBase]: 519/4505 cut-off events. [2024-10-13 10:01:45,159 INFO L125 PetriNetUnfolderBase]: For 208/269 co-relation queries the response was YES. [2024-10-13 10:01:45,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6219 conditions, 4505 events. 519/4505 cut-off events. For 208/269 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 41223 event pairs, 169 based on Foata normal form. 1/4033 useless extension candidates. Maximal degree in co-relation 5925. Up to 612 conditions per place. [2024-10-13 10:01:45,192 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 19 selfloop transitions, 5 changer transitions 0/258 dead transitions. [2024-10-13 10:01:45,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 688 flow [2024-10-13 10:01:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-10-13 10:01:45,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2024-10-13 10:01:45,195 INFO L175 Difference]: Start difference. First operand has 248 places, 252 transitions, 624 flow. Second operand 3 states and 754 transitions. [2024-10-13 10:01:45,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 688 flow [2024-10-13 10:01:45,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 258 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:45,202 INFO L231 Difference]: Finished difference. Result has 250 places, 255 transitions, 652 flow [2024-10-13 10:01:45,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=250, PETRI_TRANSITIONS=255} [2024-10-13 10:01:45,203 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -4 predicate places. [2024-10-13 10:01:45,203 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 255 transitions, 652 flow [2024-10-13 10:01:45,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 10:01:45,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:45,204 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] [2024-10-13 10:01:45,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:01:45,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:45,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash 198871835, now seen corresponding path program 1 times [2024-10-13 10:01:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170892189] [2024-10-13 10:01:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:45,246 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-13 10:01:45,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170892189] [2024-10-13 10:01:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170892189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408927311] [2024-10-13 10:01:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:45,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:45,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 268 [2024-10-13 10:01:45,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 255 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 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-13 10:01:45,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:45,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 268 [2024-10-13 10:01:45,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:46,004 INFO L124 PetriNetUnfolderBase]: 666/5669 cut-off events. [2024-10-13 10:01:46,005 INFO L125 PetriNetUnfolderBase]: For 377/382 co-relation queries the response was YES. [2024-10-13 10:01:46,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7995 conditions, 5669 events. 666/5669 cut-off events. For 377/382 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 55471 event pairs, 200 based on Foata normal form. 1/5108 useless extension candidates. Maximal degree in co-relation 7724. Up to 765 conditions per place. [2024-10-13 10:01:46,035 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 19 selfloop transitions, 5 changer transitions 0/261 dead transitions. [2024-10-13 10:01:46,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 715 flow [2024-10-13 10:01:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-10-13 10:01:46,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2024-10-13 10:01:46,039 INFO L175 Difference]: Start difference. First operand has 250 places, 255 transitions, 652 flow. Second operand 3 states and 754 transitions. [2024-10-13 10:01:46,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 715 flow [2024-10-13 10:01:46,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 261 transitions, 703 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:46,049 INFO L231 Difference]: Finished difference. Result has 252 places, 258 transitions, 676 flow [2024-10-13 10:01:46,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=252, PETRI_TRANSITIONS=258} [2024-10-13 10:01:46,050 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -2 predicate places. [2024-10-13 10:01:46,051 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 258 transitions, 676 flow [2024-10-13 10:01:46,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 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-13 10:01:46,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:46,052 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:46,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:01:46,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:46,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2053692362, now seen corresponding path program 1 times [2024-10-13 10:01:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:46,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283305610] [2024-10-13 10:01:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:46,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:46,110 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-13 10:01:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283305610] [2024-10-13 10:01:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283305610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071561481] [2024-10-13 10:01:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:46,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:46,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 268 [2024-10-13 10:01:46,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 258 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-13 10:01:46,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:46,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 268 [2024-10-13 10:01:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:46,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 322#true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 210#L726-3true, Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 327#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:46,763 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:46,763 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:46,764 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:46,764 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:46,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 322#true, 132#L763-1true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 327#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:46,784 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:46,784 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:46,784 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:46,784 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:46,859 INFO L124 PetriNetUnfolderBase]: 705/6105 cut-off events. [2024-10-13 10:01:46,859 INFO L125 PetriNetUnfolderBase]: For 433/436 co-relation queries the response was YES. [2024-10-13 10:01:46,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8691 conditions, 6105 events. 705/6105 cut-off events. For 433/436 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 61085 event pairs, 243 based on Foata normal form. 0/5554 useless extension candidates. Maximal degree in co-relation 8425. Up to 869 conditions per place. [2024-10-13 10:01:46,893 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 19 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-10-13 10:01:46,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 260 transitions, 723 flow [2024-10-13 10:01:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2024-10-13 10:01:46,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2024-10-13 10:01:46,896 INFO L175 Difference]: Start difference. First operand has 252 places, 258 transitions, 676 flow. Second operand 3 states and 744 transitions. [2024-10-13 10:01:46,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 260 transitions, 723 flow [2024-10-13 10:01:46,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 260 transitions, 711 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:46,905 INFO L231 Difference]: Finished difference. Result has 251 places, 257 transitions, 666 flow [2024-10-13 10:01:46,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=251, PETRI_TRANSITIONS=257} [2024-10-13 10:01:46,906 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -3 predicate places. [2024-10-13 10:01:46,906 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 257 transitions, 666 flow [2024-10-13 10:01:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-13 10:01:46,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:46,907 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] [2024-10-13 10:01:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:01:46,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1078202447, now seen corresponding path program 1 times [2024-10-13 10:01:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916337608] [2024-10-13 10:01:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:46,956 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-13 10:01:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916337608] [2024-10-13 10:01:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916337608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:46,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59135407] [2024-10-13 10:01:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:46,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 268 [2024-10-13 10:01:46,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 257 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-13 10:01:46,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:46,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 268 [2024-10-13 10:01:46,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:47,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 210#L726-3true, Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 330#true, 327#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:47,464 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:47,464 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:47,464 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:47,464 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:47,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 132#L763-1true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, Black: 298#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 327#true, 330#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:47,493 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:47,493 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:47,493 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:47,493 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:47,590 INFO L124 PetriNetUnfolderBase]: 721/6183 cut-off events. [2024-10-13 10:01:47,590 INFO L125 PetriNetUnfolderBase]: For 686/711 co-relation queries the response was YES. [2024-10-13 10:01:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 6183 events. 721/6183 cut-off events. For 686/711 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 61416 event pairs, 185 based on Foata normal form. 5/5610 useless extension candidates. Maximal degree in co-relation 8612. Up to 804 conditions per place. [2024-10-13 10:01:47,628 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 19 selfloop transitions, 9 changer transitions 0/266 dead transitions. [2024-10-13 10:01:47,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 266 transitions, 754 flow [2024-10-13 10:01:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-13 10:01:47,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390547263681592 [2024-10-13 10:01:47,631 INFO L175 Difference]: Start difference. First operand has 251 places, 257 transitions, 666 flow. Second operand 3 states and 755 transitions. [2024-10-13 10:01:47,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 266 transitions, 754 flow [2024-10-13 10:01:47,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 266 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:47,641 INFO L231 Difference]: Finished difference. Result has 253 places, 263 transitions, 736 flow [2024-10-13 10:01:47,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=253, PETRI_TRANSITIONS=263} [2024-10-13 10:01:47,642 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -1 predicate places. [2024-10-13 10:01:47,642 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 263 transitions, 736 flow [2024-10-13 10:01:47,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-13 10:01:47,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:47,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:47,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:01:47,643 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash -635670701, now seen corresponding path program 1 times [2024-10-13 10:01:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:47,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627331937] [2024-10-13 10:01:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:47,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:47,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627331937] [2024-10-13 10:01:47,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627331937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:47,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:47,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:47,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708486754] [2024-10-13 10:01:47,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:47,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:47,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:47,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 268 [2024-10-13 10:01:47,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 263 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 10:01:47,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:47,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 268 [2024-10-13 10:01:47,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:47,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][156], [Black: 284#true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 246#L707-3true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 330#true]) [2024-10-13 10:01:47,936 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,936 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,937 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:47,937 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:47,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([742] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][162], [Black: 284#true, 72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 246#L707-3true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 330#true]) [2024-10-13 10:01:47,979 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 10:01:47,979 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:47,979 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,979 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:47,980 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([742] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][162], [Black: 284#true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 246#L707-3true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 330#true]) [2024-10-13 10:01:47,980 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 10:01:47,980 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:47,980 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,980 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:47,980 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 10:01:47,993 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([639] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][156], [Black: 284#true, 72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 246#L707-3true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 330#true]) [2024-10-13 10:01:47,993 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 10:01:47,993 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,994 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:47,994 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:47,994 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:48,390 INFO L124 PetriNetUnfolderBase]: 834/6427 cut-off events. [2024-10-13 10:01:48,390 INFO L125 PetriNetUnfolderBase]: For 1039/1078 co-relation queries the response was YES. [2024-10-13 10:01:48,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9600 conditions, 6427 events. 834/6427 cut-off events. For 1039/1078 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 64517 event pairs, 194 based on Foata normal form. 5/5822 useless extension candidates. Maximal degree in co-relation 9312. Up to 869 conditions per place. [2024-10-13 10:01:48,429 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 19 selfloop transitions, 9 changer transitions 0/272 dead transitions. [2024-10-13 10:01:48,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 272 transitions, 823 flow [2024-10-13 10:01:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-13 10:01:48,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390547263681592 [2024-10-13 10:01:48,431 INFO L175 Difference]: Start difference. First operand has 253 places, 263 transitions, 736 flow. Second operand 3 states and 755 transitions. [2024-10-13 10:01:48,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 272 transitions, 823 flow [2024-10-13 10:01:48,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 272 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:48,441 INFO L231 Difference]: Finished difference. Result has 255 places, 269 transitions, 792 flow [2024-10-13 10:01:48,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=255, PETRI_TRANSITIONS=269} [2024-10-13 10:01:48,443 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, 1 predicate places. [2024-10-13 10:01:48,443 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 269 transitions, 792 flow [2024-10-13 10:01:48,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 10:01:48,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:48,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:48,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:01:48,445 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:48,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1047394821, now seen corresponding path program 1 times [2024-10-13 10:01:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:48,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999025100] [2024-10-13 10:01:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:48,519 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-13 10:01:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:48,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999025100] [2024-10-13 10:01:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999025100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:48,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396991605] [2024-10-13 10:01:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:48,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-10-13 10:01:48,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 269 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-13 10:01:48,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:48,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-10-13 10:01:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:49,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([622] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][209], [Black: 284#true, 72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, 254#L727-1true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 298#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 241#L748-4true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true]) [2024-10-13 10:01:49,186 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 10:01:49,186 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:49,187 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:49,187 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:49,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 210#L726-3true, Black: 294#true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 335#true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:49,351 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:49,351 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:49,351 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:49,351 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:49,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 132#L763-1true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 250#L750-2true, 335#true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:49,398 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:49,398 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:49,399 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:49,399 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:49,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][251], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, Black: 298#true, Black: 330#true, Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 335#true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, 68#L731-3true, 163#L747-3true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:49,622 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2024-10-13 10:01:49,622 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 10:01:49,623 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-10-13 10:01:49,623 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-13 10:01:49,655 INFO L124 PetriNetUnfolderBase]: 1223/8591 cut-off events. [2024-10-13 10:01:49,655 INFO L125 PetriNetUnfolderBase]: For 1495/1550 co-relation queries the response was YES. [2024-10-13 10:01:49,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13449 conditions, 8591 events. 1223/8591 cut-off events. For 1495/1550 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 90207 event pairs, 360 based on Foata normal form. 6/7936 useless extension candidates. Maximal degree in co-relation 13114. Up to 1437 conditions per place. [2024-10-13 10:01:49,716 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 25 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2024-10-13 10:01:49,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 276 transitions, 872 flow [2024-10-13 10:01:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-10-13 10:01:49,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2024-10-13 10:01:49,719 INFO L175 Difference]: Start difference. First operand has 255 places, 269 transitions, 792 flow. Second operand 3 states and 742 transitions. [2024-10-13 10:01:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 276 transitions, 872 flow [2024-10-13 10:01:49,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 276 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:49,735 INFO L231 Difference]: Finished difference. Result has 257 places, 273 transitions, 816 flow [2024-10-13 10:01:49,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=257, PETRI_TRANSITIONS=273} [2024-10-13 10:01:49,736 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, 3 predicate places. [2024-10-13 10:01:49,736 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 273 transitions, 816 flow [2024-10-13 10:01:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 0 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-13 10:01:49,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:49,737 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:49,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:01:49,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:49,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash -507407430, now seen corresponding path program 1 times [2024-10-13 10:01:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:49,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105242134] [2024-10-13 10:01:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:49,908 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-13 10:01:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105242134] [2024-10-13 10:01:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105242134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316440819] [2024-10-13 10:01:49,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:49,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:49,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:49,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 268 [2024-10-13 10:01:49,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 273 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 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-13 10:01:49,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:49,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 268 [2024-10-13 10:01:49,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:50,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][156], [Black: 284#true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 345#true, 246#L707-3true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 298#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true]) [2024-10-13 10:01:50,281 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 10:01:50,281 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:50,281 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:50,281 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:50,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([742] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][162], [Black: 284#true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 345#true, 246#L707-3true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 298#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true]) [2024-10-13 10:01:50,302 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 10:01:50,302 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:50,302 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:50,302 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 10:01:50,361 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([742] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][162], [Black: 284#true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, 189#L695-7true, Black: 289#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 345#true, 246#L707-3true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true]) [2024-10-13 10:01:50,362 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-13 10:01:50,362 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-13 10:01:50,362 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-13 10:01:50,362 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 10:01:50,362 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-13 10:01:50,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([622] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][209], [Black: 284#true, 72#L762-4true, Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 291#(= |#race~receive~0| 0), Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 254#L727-1true, 345#true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, 241#L748-4true, Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true]) [2024-10-13 10:01:50,653 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 10:01:50,653 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:50,653 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:50,653 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:50,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, Black: 291#(= |#race~receive~0| 0), Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 210#L726-3true, 345#true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L750-2true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:50,836 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 10:01:50,836 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-13 10:01:50,836 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 10:01:50,836 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-13 10:01:50,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][112], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 132#L763-1true, Black: 291#(= |#race~receive~0| 0), Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 345#true, Black: 298#true, Black: 332#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 270#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 250#L750-2true, Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:50,873 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-13 10:01:50,874 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-13 10:01:50,874 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-13 10:01:50,874 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 10:01:50,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][235], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, Black: 291#(= |#race~receive~0| 0), Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 262#true, Black: 294#true, 345#true, Black: 298#true, Black: 330#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 296#(= |#race~buffer_size~0| 0), 340#true, 68#L731-3true, 163#L747-3true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:50,951 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-10-13 10:01:50,951 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-13 10:01:50,951 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 10:01:50,951 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-10-13 10:01:51,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][235], [Black: 319#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 72#L762-4true, Black: 291#(= |#race~receive~0| 0), 262#true, Black: 324#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 294#true, Black: 298#true, Black: 330#true, Black: 337#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 270#true, Black: 304#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 347#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), Black: 309#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 342#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 296#(= |#race~buffer_size~0| 0), Black: 314#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 340#true, 68#L731-3true, 163#L747-3true, Black: 286#(= |#race~send~0| 0)]) [2024-10-13 10:01:51,054 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-10-13 10:01:51,054 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-10-13 10:01:51,054 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2024-10-13 10:01:51,054 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 10:01:51,093 INFO L124 PetriNetUnfolderBase]: 1162/10043 cut-off events. [2024-10-13 10:01:51,093 INFO L125 PetriNetUnfolderBase]: For 1912/2037 co-relation queries the response was YES. [2024-10-13 10:01:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15349 conditions, 10043 events. 1162/10043 cut-off events. For 1912/2037 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 112887 event pairs, 192 based on Foata normal form. 10/9255 useless extension candidates. Maximal degree in co-relation 15062. Up to 745 conditions per place. [2024-10-13 10:01:51,142 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 19 selfloop transitions, 5 changer transitions 0/281 dead transitions. [2024-10-13 10:01:51,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 281 transitions, 883 flow [2024-10-13 10:01:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 756 transitions. [2024-10-13 10:01:51,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2024-10-13 10:01:51,146 INFO L175 Difference]: Start difference. First operand has 257 places, 273 transitions, 816 flow. Second operand 3 states and 756 transitions. [2024-10-13 10:01:51,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 281 transitions, 883 flow [2024-10-13 10:01:51,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 281 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:51,159 INFO L231 Difference]: Finished difference. Result has 259 places, 276 transitions, 842 flow [2024-10-13 10:01:51,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=259, PETRI_TRANSITIONS=276} [2024-10-13 10:01:51,160 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, 5 predicate places. [2024-10-13 10:01:51,160 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 276 transitions, 842 flow [2024-10-13 10:01:51,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 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-13 10:01:51,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:51,161 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] [2024-10-13 10:01:51,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:01:51,161 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 10:01:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash 208083866, now seen corresponding path program 1 times [2024-10-13 10:01:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054059606] [2024-10-13 10:01:51,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:51,248 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-13 10:01:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054059606] [2024-10-13 10:01:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054059606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:51,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:01:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550664112] [2024-10-13 10:01:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:51,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 268 [2024-10-13 10:01:51,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 276 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-13 10:01:51,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:51,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 268 [2024-10-13 10:01:51,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:51,444 INFO L124 PetriNetUnfolderBase]: 156/1911 cut-off events. [2024-10-13 10:01:51,444 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2024-10-13 10:01:51,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1911 events. 156/1911 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14015 event pairs, 18 based on Foata normal form. 40/1846 useless extension candidates. Maximal degree in co-relation 2569. Up to 98 conditions per place. [2024-10-13 10:01:51,452 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 0 selfloop transitions, 0 changer transitions 235/235 dead transitions. [2024-10-13 10:01:51,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 235 transitions, 651 flow [2024-10-13 10:01:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2024-10-13 10:01:51,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490049751243781 [2024-10-13 10:01:51,454 INFO L175 Difference]: Start difference. First operand has 259 places, 276 transitions, 842 flow. Second operand 3 states and 763 transitions. [2024-10-13 10:01:51,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 235 transitions, 651 flow [2024-10-13 10:01:51,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 235 transitions, 567 flow, removed 21 selfloop flow, removed 16 redundant places. [2024-10-13 10:01:51,460 INFO L231 Difference]: Finished difference. Result has 235 places, 0 transitions, 0 flow [2024-10-13 10:01:51,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=235, PETRI_TRANSITIONS=0} [2024-10-13 10:01:51,461 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -19 predicate places. [2024-10-13 10:01:51,461 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 0 transitions, 0 flow [2024-10-13 10:01:51,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-13 10:01:51,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2024-10-13 10:01:51,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2024-10-13 10:01:51,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2024-10-13 10:01:51,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2024-10-13 10:01:51,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2024-10-13 10:01:51,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2024-10-13 10:01:51,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2024-10-13 10:01:51,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2024-10-13 10:01:51,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2024-10-13 10:01:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:01:51,474 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:51,481 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:01:51,482 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:01:51,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:01:51 BasicIcfg [2024-10-13 10:01:51,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:01:51,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:01:51,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:01:51,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:01:51,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:37" (3/4) ... [2024-10-13 10:01:51,490 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:01:51,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-10-13 10:01:51,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-10-13 10:01:51,497 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 10:01:51,498 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:01:51,498 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:01:51,498 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:01:51,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:01:51,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:01:51,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:01:51,584 INFO L158 Benchmark]: Toolchain (without parser) took 15363.19ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.3MB in the beginning and 771.6MB in the end (delta: -651.3MB). Peak memory consumption was 454.2MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,584 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:51,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.58ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 97.2MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.65ms. Allocated memory is still 176.2MB. Free memory was 97.2MB in the beginning and 94.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,586 INFO L158 Benchmark]: Boogie Preprocessor took 48.59ms. Allocated memory is still 176.2MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,586 INFO L158 Benchmark]: RCFGBuilder took 693.52ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 67.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,586 INFO L158 Benchmark]: TraceAbstraction took 13919.97ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 66.5MB in the beginning and 775.8MB in the end (delta: -709.4MB). Peak memory consumption was 395.5MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,586 INFO L158 Benchmark]: Witness Printer took 95.75ms. Allocated memory is still 1.3GB. Free memory was 775.8MB in the beginning and 771.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:01:51,587 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.20ms. Allocated memory is still 176.2MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.58ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 97.2MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.65ms. Allocated memory is still 176.2MB. Free memory was 97.2MB in the beginning and 94.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.59ms. Allocated memory is still 176.2MB. Free memory was 94.4MB in the beginning and 92.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 693.52ms. Allocated memory is still 176.2MB. Free memory was 92.3MB in the beginning and 67.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13919.97ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 66.5MB in the beginning and 775.8MB in the end (delta: -709.4MB). Peak memory consumption was 395.5MB. Max. memory is 16.1GB. * Witness Printer took 95.75ms. Allocated memory is still 1.3GB. Free memory was 775.8MB in the beginning and 771.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 747]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 748]: 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, 425 locations, 54 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.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 93 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=842occurred in iteration=20, InterpolantAutomatonStates: 63, 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, 1.3s InterpolantComputationTime, 1726 NumberOfCodeBlocks, 1726 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1705 ConstructedInterpolants, 0 QuantifiedInterpolants, 1860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:01:51,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE