/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-ext/01b_inc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 18:23:51,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 18:23:52,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 18:23:52,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 18:23:52,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 18:23:52,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 18:23:52,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 18:23:52,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 18:23:52,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 18:23:52,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 18:23:52,094 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 18:23:52,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 18:23:52,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 18:23:52,095 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 18:23:52,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 18:23:52,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 18:23:52,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 18:23:52,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 18:23:52,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 18:23:52,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 18:23:52,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 18:23:52,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 18:23:52,097 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 18:23:52,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 18:23:52,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 18:23:52,097 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 18:23:52,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 18:23:52,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 18:23:52,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 18:23:52,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 18:23:52,099 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-24 18:23:52,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 18:23:52,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 18:23:52,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 18:23:52,347 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 18:23:52,348 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 18:23:52,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/01b_inc.i [2023-08-24 18:23:53,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 18:23:53,448 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 18:23:53,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/01b_inc.i [2023-08-24 18:23:53,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7013959f0/dc585f3388e94d6bbc1b953429eacec9/FLAG69894f132 [2023-08-24 18:23:53,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7013959f0/dc585f3388e94d6bbc1b953429eacec9 [2023-08-24 18:23:53,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 18:23:53,469 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 18:23:53,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 18:23:53,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 18:23:53,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 18:23:53,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fac12ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53, skipping insertion in model container [2023-08-24 18:23:53,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,509 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 18:23:53,609 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 18:23:53,721 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 18:23:53,729 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 18:23:53,746 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-24 18:23:53,754 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-24 18:23:53,755 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [269] [2023-08-24 18:23:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: volatile unsigned [704] [2023-08-24 18:23:53,768 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned [716] [2023-08-24 18:23:53,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 18:23:53,803 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 18:23:53,803 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 18:23:53,803 WARN L669 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 18:23:53,808 INFO L206 MainTranslator]: Completed translation [2023-08-24 18:23:53,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53 WrapperNode [2023-08-24 18:23:53,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 18:23:53,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 18:23:53,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 18:23:53,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 18:23:53,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,854 INFO L138 Inliner]: procedures = 173, calls = 21, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 93 [2023-08-24 18:23:53,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 18:23:53,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 18:23:53,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 18:23:53,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 18:23:53,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 18:23:53,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 18:23:53,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 18:23:53,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 18:23:53,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (1/1) ... [2023-08-24 18:23:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 18:23:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 18:23:53,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 18:23:53,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 18:23:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-24 18:23:53,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 18:23:53,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 18:23:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 18:23:53,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 18:23:53,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 18:23:53,940 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 18:23:54,044 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 18:23:54,045 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 18:23:54,158 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 18:23:54,252 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 18:23:54,252 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-24 18:23:54,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 06:23:54 BoogieIcfgContainer [2023-08-24 18:23:54,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 18:23:54,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 18:23:54,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 18:23:54,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 18:23:54,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 06:23:53" (1/3) ... [2023-08-24 18:23:54,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced0c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 06:23:54, skipping insertion in model container [2023-08-24 18:23:54,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 06:23:53" (2/3) ... [2023-08-24 18:23:54,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ced0c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 06:23:54, skipping insertion in model container [2023-08-24 18:23:54,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 06:23:54" (3/3) ... [2023-08-24 18:23:54,259 INFO L112 eAbstractionObserver]: Analyzing ICFG 01b_inc.i [2023-08-24 18:23:54,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 18:23:54,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-24 18:23:54,271 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 18:23:54,295 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 18:23:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,346 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-08-24 18:23:54,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:54,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 3/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-24 18:23:54,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,353 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 18:23:54,359 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,360 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 113 flow [2023-08-24 18:23:54,370 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-08-24 18:23:54,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:54,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 3/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-24 18:23:54,371 INFO L119 LiptonReduction]: Number of co-enabled transitions 728 [2023-08-24 18:23:56,144 INFO L134 LiptonReduction]: Checked pairs total: 787 [2023-08-24 18:23:56,144 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-24 18:23:56,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 18:23:56,157 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@62492088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 18:23:56,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-24 18:23:56,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 18:23:56,159 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-24 18:23:56,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:56,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:56,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 18:23:56,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-24 18:23:56,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 11993214, now seen corresponding path program 1 times [2023-08-24 18:23:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250827728] [2023-08-24 18:23:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250827728] [2023-08-24 18:23:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250827728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:56,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 18:23:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314697501] [2023-08-24 18:23:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:56,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 18:23:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 18:23:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 18:23:56,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-08-24 18:23:56,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 41 flow. Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-08-24 18:23:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:23:56,304 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2023-08-24 18:23:56,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:56,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 12 events. 2/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 2 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-08-24 18:23:56,305 INFO L140 encePairwiseOnDemand]: 107/119 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-08-24 18:23:56,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2023-08-24 18:23:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 18:23:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 18:23:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2023-08-24 18:23:56,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2023-08-24 18:23:56,312 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 91 transitions. [2023-08-24 18:23:56,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 91 transitions. [2023-08-24 18:23:56,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:23:56,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 91 transitions. [2023-08-24 18:23:56,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:56,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:56,318 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:56,319 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 41 flow. Second operand 2 states and 91 transitions. [2023-08-24 18:23:56,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2023-08-24 18:23:56,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 18:23:56,321 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 17 flow [2023-08-24 18:23:56,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-08-24 18:23:56,324 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -11 predicate places. [2023-08-24 18:23:56,325 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 17 flow [2023-08-24 18:23:56,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:56,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:56,325 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-24 18:23:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 18:23:56,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-08-24 18:23:56,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1359445754, now seen corresponding path program 1 times [2023-08-24 18:23:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810926839] [2023-08-24 18:23:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:23:56,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 18:23:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:23:56,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 18:23:56,361 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 18:23:56,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-08-24 18:23:56,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2023-08-24 18:23:56,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2023-08-24 18:23:56,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2023-08-24 18:23:56,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (11 of 23 remaining) [2023-08-24 18:23:56,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2023-08-24 18:23:56,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2023-08-24 18:23:56,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2023-08-24 18:23:56,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (0 of 23 remaining) [2023-08-24 18:23:56,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 18:23:56,366 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-24 18:23:56,368 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 18:23:56,368 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 18:23:56,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 18:23:56,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,394 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-08-24 18:23:56,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 18:23:56,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-24 18:23:56,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,396 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 18:23:56,396 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 83 transitions, 178 flow [2023-08-24 18:23:56,422 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-08-24 18:23:56,422 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 18:23:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-24 18:23:56,426 INFO L119 LiptonReduction]: Number of co-enabled transitions 3080 [2023-08-24 18:23:57,292 INFO L134 LiptonReduction]: Checked pairs total: 14758 [2023-08-24 18:23:57,293 INFO L136 LiptonReduction]: Total number of compositions: 46 [2023-08-24 18:23:57,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 18:23:57,295 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@62492088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 18:23:57,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-08-24 18:23:57,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 18:23:57,297 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-24 18:23:57,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:57,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:57,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 18:23:57,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2023-08-24 18:23:57,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 16928763, now seen corresponding path program 1 times [2023-08-24 18:23:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118494116] [2023-08-24 18:23:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118494116] [2023-08-24 18:23:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118494116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 18:23:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414226616] [2023-08-24 18:23:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:57,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 18:23:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 18:23:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 18:23:57,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 129 [2023-08-24 18:23:57,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:57,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 129 [2023-08-24 18:23:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:23:57,411 INFO L124 PetriNetUnfolderBase]: 121/311 cut-off events. [2023-08-24 18:23:57,411 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 18:23:57,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 311 events. 121/311 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1552 event pairs, 95 based on Foata normal form. 26/261 useless extension candidates. Maximal degree in co-relation 200. Up to 208 conditions per place. [2023-08-24 18:23:57,415 INFO L140 encePairwiseOnDemand]: 112/129 looper letters, 16 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2023-08-24 18:23:57,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 118 flow [2023-08-24 18:23:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 18:23:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 18:23:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2023-08-24 18:23:57,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2023-08-24 18:23:57,418 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 135 transitions. [2023-08-24 18:23:57,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 135 transitions. [2023-08-24 18:23:57,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:23:57,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 135 transitions. [2023-08-24 18:23:57,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,423 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,423 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 120 flow. Second operand 2 states and 135 transitions. [2023-08-24 18:23:57,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 118 flow [2023-08-24 18:23:57,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 116 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-24 18:23:57,424 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-24 18:23:57,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-24 18:23:57,425 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2023-08-24 18:23:57,425 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-24 18:23:57,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:57,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 18:23:57,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 18:23:57,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2023-08-24 18:23:57,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash -911314533, now seen corresponding path program 1 times [2023-08-24 18:23:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226326576] [2023-08-24 18:23:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226326576] [2023-08-24 18:23:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226326576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 18:23:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332095958] [2023-08-24 18:23:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:57,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 18:23:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 18:23:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 18:23:57,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 129 [2023-08-24 18:23:57,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:57,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 129 [2023-08-24 18:23:57,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:23:57,559 INFO L124 PetriNetUnfolderBase]: 433/830 cut-off events. [2023-08-24 18:23:57,560 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-24 18:23:57,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 830 events. 433/830 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4586 event pairs, 137 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1600. Up to 534 conditions per place. [2023-08-24 18:23:57,563 INFO L140 encePairwiseOnDemand]: 111/129 looper letters, 36 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2023-08-24 18:23:57,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 233 flow [2023-08-24 18:23:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 18:23:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 18:23:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2023-08-24 18:23:57,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2023-08-24 18:23:57,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 171 transitions. [2023-08-24 18:23:57,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 171 transitions. [2023-08-24 18:23:57,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:23:57,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 171 transitions. [2023-08-24 18:23:57,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,570 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 171 transitions. [2023-08-24 18:23:57,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 233 flow [2023-08-24 18:23:57,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 18:23:57,572 INFO L231 Difference]: Finished difference. Result has 45 places, 51 transitions, 204 flow [2023-08-24 18:23:57,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=45, PETRI_TRANSITIONS=51} [2023-08-24 18:23:57,573 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2023-08-24 18:23:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 204 flow [2023-08-24 18:23:57,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:57,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:57,574 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-24 18:23:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 18:23:57,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2023-08-24 18:23:57,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2037797831, now seen corresponding path program 1 times [2023-08-24 18:23:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:57,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806380443] [2023-08-24 18:23:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:23:57,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 18:23:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:23:57,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 18:23:57,609 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 34 remaining) [2023-08-24 18:23:57,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (22 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2023-08-24 18:23:57,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (13 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (11 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2023-08-24 18:23:57,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2023-08-24 18:23:57,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (0 of 34 remaining) [2023-08-24 18:23:57,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 18:23:57,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-24 18:23:57,614 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 18:23:57,614 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-24 18:23:57,643 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 18:23:57,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,660 INFO L124 PetriNetUnfolderBase]: 7/146 cut-off events. [2023-08-24 18:23:57,661 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 18:23:57,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 146 events. 7/146 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 410 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-24 18:23:57,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,663 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 18:23:57,663 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,663 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 112 transitions, 245 flow [2023-08-24 18:23:57,672 INFO L124 PetriNetUnfolderBase]: 7/146 cut-off events. [2023-08-24 18:23:57,673 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-24 18:23:57,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 146 events. 7/146 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 410 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-24 18:23:57,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 7056 [2023-08-24 18:23:58,755 INFO L134 LiptonReduction]: Checked pairs total: 37980 [2023-08-24 18:23:58,755 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-24 18:23:58,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 18:23:58,757 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@62492088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 18:23:58,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-08-24 18:23:58,758 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 18:23:58,758 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-24 18:23:58,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:23:58,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:58,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 18:23:58,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-08-24 18:23:58,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 23115890, now seen corresponding path program 1 times [2023-08-24 18:23:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848840465] [2023-08-24 18:23:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848840465] [2023-08-24 18:23:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848840465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 18:23:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248369073] [2023-08-24 18:23:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 18:23:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 18:23:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 18:23:58,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 172 [2023-08-24 18:23:58,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 177 flow. Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:58,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 172 [2023-08-24 18:23:58,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:23:58,912 INFO L124 PetriNetUnfolderBase]: 1237/2191 cut-off events. [2023-08-24 18:23:58,912 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2023-08-24 18:23:58,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 2191 events. 1237/2191 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14084 event pairs, 995 based on Foata normal form. 242/1908 useless extension candidates. Maximal degree in co-relation 776. Up to 1756 conditions per place. [2023-08-24 18:23:58,924 INFO L140 encePairwiseOnDemand]: 147/172 looper letters, 23 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2023-08-24 18:23:58,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 173 flow [2023-08-24 18:23:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 18:23:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 18:23:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2023-08-24 18:23:58,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2023-08-24 18:23:58,926 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 178 transitions. [2023-08-24 18:23:58,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 178 transitions. [2023-08-24 18:23:58,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:23:58,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 178 transitions. [2023-08-24 18:23:58,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,928 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,928 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 177 flow. Second operand 2 states and 178 transitions. [2023-08-24 18:23:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 173 flow [2023-08-24 18:23:58,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 167 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-24 18:23:58,929 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 121 flow [2023-08-24 18:23:58,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=121, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-24 18:23:58,930 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -24 predicate places. [2023-08-24 18:23:58,930 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 121 flow [2023-08-24 18:23:58,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:58,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 18:23:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 18:23:58,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-08-24 18:23:58,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 739555157, now seen corresponding path program 1 times [2023-08-24 18:23:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54908450] [2023-08-24 18:23:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:58,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:58,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54908450] [2023-08-24 18:23:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54908450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:58,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 18:23:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934297608] [2023-08-24 18:23:58,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:58,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 18:23:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:58,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 18:23:58,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 18:23:58,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 172 [2023-08-24 18:23:58,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:58,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:58,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 172 [2023-08-24 18:23:58,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:23:59,766 INFO L124 PetriNetUnfolderBase]: 10109/15518 cut-off events. [2023-08-24 18:23:59,767 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-08-24 18:23:59,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30422 conditions, 15518 events. 10109/15518 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 109638 event pairs, 3517 based on Foata normal form. 0/13001 useless extension candidates. Maximal degree in co-relation 30416. Up to 10538 conditions per place. [2023-08-24 18:23:59,834 INFO L140 encePairwiseOnDemand]: 145/172 looper letters, 53 selfloop transitions, 21 changer transitions 0/86 dead transitions. [2023-08-24 18:23:59,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 345 flow [2023-08-24 18:23:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 18:23:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 18:23:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2023-08-24 18:23:59,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42829457364341084 [2023-08-24 18:23:59,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2023-08-24 18:23:59,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2023-08-24 18:23:59,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:23:59,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2023-08-24 18:23:59,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:59,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:59,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:59,837 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 121 flow. Second operand 3 states and 221 transitions. [2023-08-24 18:23:59,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 345 flow [2023-08-24 18:23:59,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 345 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 18:23:59,839 INFO L231 Difference]: Finished difference. Result has 62 places, 74 transitions, 301 flow [2023-08-24 18:23:59,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=62, PETRI_TRANSITIONS=74} [2023-08-24 18:23:59,840 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -20 predicate places. [2023-08-24 18:23:59,840 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 74 transitions, 301 flow [2023-08-24 18:23:59,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:59,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:23:59,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 18:23:59,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 18:23:59,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err10ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-08-24 18:23:59,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:23:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 809520788, now seen corresponding path program 1 times [2023-08-24 18:23:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:23:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254721388] [2023-08-24 18:23:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:23:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:23:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:23:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:23:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:23:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254721388] [2023-08-24 18:23:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254721388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:23:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:23:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 18:23:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833510517] [2023-08-24 18:23:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:23:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 18:23:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:23:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 18:23:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 18:23:59,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 172 [2023-08-24 18:23:59,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:23:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:23:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 172 [2023-08-24 18:23:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:24:01,420 INFO L124 PetriNetUnfolderBase]: 16914/25436 cut-off events. [2023-08-24 18:24:01,420 INFO L125 PetriNetUnfolderBase]: For 8474/9392 co-relation queries the response was YES. [2023-08-24 18:24:01,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66460 conditions, 25436 events. 16914/25436 cut-off events. For 8474/9392 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 186693 event pairs, 4806 based on Foata normal form. 12/20156 useless extension candidates. Maximal degree in co-relation 66452. Up to 11108 conditions per place. [2023-08-24 18:24:01,578 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 114 selfloop transitions, 15 changer transitions 0/162 dead transitions. [2023-08-24 18:24:01,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 881 flow [2023-08-24 18:24:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 18:24:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 18:24:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 434 transitions. [2023-08-24 18:24:01,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42054263565891475 [2023-08-24 18:24:01,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 434 transitions. [2023-08-24 18:24:01,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 434 transitions. [2023-08-24 18:24:01,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:24:01,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 434 transitions. [2023-08-24 18:24:01,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:01,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:01,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:01,687 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 301 flow. Second operand 6 states and 434 transitions. [2023-08-24 18:24:01,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 881 flow [2023-08-24 18:24:01,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 162 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 18:24:01,713 INFO L231 Difference]: Finished difference. Result has 69 places, 89 transitions, 402 flow [2023-08-24 18:24:01,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=69, PETRI_TRANSITIONS=89} [2023-08-24 18:24:01,714 INFO L281 CegarLoopForPetriNet]: 82 programPoint places, -13 predicate places. [2023-08-24 18:24:01,714 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 89 transitions, 402 flow [2023-08-24 18:24:01,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:01,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:24:01,714 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-24 18:24:01,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 18:24:01,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-08-24 18:24:01,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:24:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -331169235, now seen corresponding path program 1 times [2023-08-24 18:24:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:24:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111942703] [2023-08-24 18:24:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:24:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:24:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:24:01,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 18:24:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:24:01,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 18:24:01,733 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 18:24:01,733 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2023-08-24 18:24:01,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2023-08-24 18:24:01,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (33 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2023-08-24 18:24:01,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (22 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2023-08-24 18:24:01,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (11 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2023-08-24 18:24:01,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2023-08-24 18:24:01,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (0 of 45 remaining) [2023-08-24 18:24:01,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 18:24:01,738 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-24 18:24:01,739 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 18:24:01,739 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-24 18:24:01,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 18:24:01,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,788 INFO L124 PetriNetUnfolderBase]: 9/187 cut-off events. [2023-08-24 18:24:01,788 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 18:24:01,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 187 events. 9/187 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 566 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 154. Up to 10 conditions per place. [2023-08-24 18:24:01,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,790 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 18:24:01,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,791 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 314 flow [2023-08-24 18:24:01,801 INFO L124 PetriNetUnfolderBase]: 9/187 cut-off events. [2023-08-24 18:24:01,801 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 18:24:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 187 events. 9/187 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 566 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 154. Up to 10 conditions per place. [2023-08-24 18:24:01,806 INFO L119 LiptonReduction]: Number of co-enabled transitions 12656 [2023-08-24 18:24:03,105 INFO L134 LiptonReduction]: Checked pairs total: 84787 [2023-08-24 18:24:03,105 INFO L136 LiptonReduction]: Total number of compositions: 74 [2023-08-24 18:24:03,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 18:24:03,107 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@62492088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 18:24:03,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-08-24 18:24:03,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 18:24:03,108 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-24 18:24:03,108 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:24:03,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:24:03,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 18:24:03,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:24:03,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:24:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 30625753, now seen corresponding path program 1 times [2023-08-24 18:24:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:24:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602107954] [2023-08-24 18:24:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:24:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:24:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:24:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:24:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:24:03,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602107954] [2023-08-24 18:24:03,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602107954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:24:03,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:24:03,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 18:24:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621819989] [2023-08-24 18:24:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:24:03,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 18:24:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:24:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 18:24:03,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 18:24:03,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 215 [2023-08-24 18:24:03,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 236 flow. Second operand has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:03,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:24:03,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 215 [2023-08-24 18:24:03,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:24:04,032 INFO L124 PetriNetUnfolderBase]: 10525/16071 cut-off events. [2023-08-24 18:24:04,032 INFO L125 PetriNetUnfolderBase]: For 2892/2892 co-relation queries the response was YES. [2023-08-24 18:24:04,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31340 conditions, 16071 events. 10525/16071 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 117904 event pairs, 8555 based on Foata normal form. 1970/14409 useless extension candidates. Maximal degree in co-relation 4217. Up to 13636 conditions per place. [2023-08-24 18:24:04,099 INFO L140 encePairwiseOnDemand]: 182/215 looper letters, 30 selfloop transitions, 0 changer transitions 0/69 dead transitions. [2023-08-24 18:24:04,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 230 flow [2023-08-24 18:24:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 18:24:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 18:24:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 221 transitions. [2023-08-24 18:24:04,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513953488372093 [2023-08-24 18:24:04,100 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 221 transitions. [2023-08-24 18:24:04,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 221 transitions. [2023-08-24 18:24:04,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:24:04,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 221 transitions. [2023-08-24 18:24:04,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:04,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:04,102 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:04,102 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 236 flow. Second operand 2 states and 221 transitions. [2023-08-24 18:24:04,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 230 flow [2023-08-24 18:24:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 218 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-24 18:24:04,105 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 158 flow [2023-08-24 18:24:04,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-24 18:24:04,106 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -32 predicate places. [2023-08-24 18:24:04,106 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 158 flow [2023-08-24 18:24:04,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:04,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:24:04,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 18:24:04,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 18:24:04,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:24:04,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:24:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -633396647, now seen corresponding path program 1 times [2023-08-24 18:24:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:24:04,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927348311] [2023-08-24 18:24:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:24:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:24:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:24:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:24:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:24:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927348311] [2023-08-24 18:24:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927348311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:24:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:24:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 18:24:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19539804] [2023-08-24 18:24:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:24:04,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 18:24:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:24:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 18:24:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 18:24:04,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 215 [2023-08-24 18:24:04,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:04,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:24:04,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 215 [2023-08-24 18:24:04,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:24:17,929 INFO L124 PetriNetUnfolderBase]: 192421/266171 cut-off events. [2023-08-24 18:24:17,929 INFO L125 PetriNetUnfolderBase]: For 6428/6428 co-relation queries the response was YES. [2023-08-24 18:24:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524913 conditions, 266171 events. 192421/266171 cut-off events. For 6428/6428 co-relation queries the response was YES. Maximal size of possible extension queue 9961. Compared 2108985 event pairs, 71795 based on Foata normal form. 0/221596 useless extension candidates. Maximal degree in co-relation 524906. Up to 182162 conditions per place. [2023-08-24 18:24:19,208 INFO L140 encePairwiseOnDemand]: 179/215 looper letters, 70 selfloop transitions, 28 changer transitions 0/113 dead transitions. [2023-08-24 18:24:19,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 457 flow [2023-08-24 18:24:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 18:24:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 18:24:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-24 18:24:19,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201550387596899 [2023-08-24 18:24:19,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-24 18:24:19,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-24 18:24:19,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:24:19,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-24 18:24:19,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:19,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:19,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:19,212 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 158 flow. Second operand 3 states and 271 transitions. [2023-08-24 18:24:19,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 457 flow [2023-08-24 18:24:19,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 113 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 18:24:19,218 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 398 flow [2023-08-24 18:24:19,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2023-08-24 18:24:19,218 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -28 predicate places. [2023-08-24 18:24:19,218 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 398 flow [2023-08-24 18:24:19,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:19,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:24:19,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 18:24:19,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 18:24:19,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err10ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:24:19,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:24:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1042573803, now seen corresponding path program 1 times [2023-08-24 18:24:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:24:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227723712] [2023-08-24 18:24:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:24:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:24:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:24:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:24:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:24:19,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227723712] [2023-08-24 18:24:19,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227723712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:24:19,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:24:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 18:24:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746491448] [2023-08-24 18:24:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:24:19,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 18:24:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:24:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 18:24:19,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 18:24:19,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215 [2023-08-24 18:24:19,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:19,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:24:19,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215 [2023-08-24 18:24:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:24:43,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][106], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, 131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:43,019 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][107], [131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:43,020 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L722-2-->L723: Formula: (= v_~value~0_3 |v_thr1Thread4of4ForFork0_~v~0#1_3|) InVars {~value~0=v_~value~0_3} OutVars{~value~0=v_~value~0_3, thr1Thread4of4ForFork0_~v~0#1=|v_thr1Thread4of4ForFork0_~v~0#1_3|} AuxVars[] AssignedVars[thr1Thread4of4ForFork0_~v~0#1][209], [107#L724true, 131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 82#L723true, 23#thr1EXITtrue]) [2023-08-24 18:24:43,020 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,020 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:24:43,021 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:43,021 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:24:45,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][106], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, 83#L718-1true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:45,195 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,195 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][107], [83#L718-1true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:45,196 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L722-2-->L723: Formula: (= v_~value~0_3 |v_thr1Thread4of4ForFork0_~v~0#1_3|) InVars {~value~0=v_~value~0_3} OutVars{~value~0=v_~value~0_3, thr1Thread4of4ForFork0_~v~0#1=|v_thr1Thread4of4ForFork0_~v~0#1_3|} AuxVars[] AssignedVars[thr1Thread4of4ForFork0_~v~0#1][209], [83#L718-1true, 107#L724true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 82#L723true, 23#thr1EXITtrue]) [2023-08-24 18:24:45,196 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:24:45,196 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:24:48,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][106], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, 131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:48,494 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,494 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][107], [131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:48,495 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L722-2-->L723: Formula: (= v_~value~0_3 |v_thr1Thread4of4ForFork0_~v~0#1_3|) InVars {~value~0=v_~value~0_3} OutVars{~value~0=v_~value~0_3, thr1Thread4of4ForFork0_~v~0#1=|v_thr1Thread4of4ForFork0_~v~0#1_3|} AuxVars[] AssignedVars[thr1Thread4of4ForFork0_~v~0#1][209], [107#L724true, 131#L718true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 82#L723true, 23#thr1EXITtrue]) [2023-08-24 18:24:48,495 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:48,495 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][106], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, 83#L718-1true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:50,111 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][107], [83#L718-1true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 68#L722-2true, 23#thr1EXITtrue]) [2023-08-24 18:24:50,111 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,112 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:24:50,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L722-2-->L723: Formula: (= v_~value~0_3 |v_thr1Thread4of4ForFork0_~v~0#1_3|) InVars {~value~0=v_~value~0_3} OutVars{~value~0=v_~value~0_3, thr1Thread4of4ForFork0_~v~0#1=|v_thr1Thread4of4ForFork0_~v~0#1_3|} AuxVars[] AssignedVars[thr1Thread4of4ForFork0_~v~0#1][209], [83#L718-1true, 107#L724true, 148#true, thr1Thread1of4ForFork0InUse, 153#(= |#race~value~0| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 25#L733-4true, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 82#L723true, 23#thr1EXITtrue]) [2023-08-24 18:24:50,112 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:24:50,112 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,112 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:24:50,112 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:24:54,557 INFO L124 PetriNetUnfolderBase]: 445531/602026 cut-off events. [2023-08-24 18:24:54,557 INFO L125 PetriNetUnfolderBase]: For 220585/244343 co-relation queries the response was YES. [2023-08-24 18:24:55,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584262 conditions, 602026 events. 445531/602026 cut-off events. For 220585/244343 co-relation queries the response was YES. Maximal size of possible extension queue 23044. Compared 4911579 event pairs, 136397 based on Foata normal form. 508/457056 useless extension candidates. Maximal degree in co-relation 1584253. Up to 272290 conditions per place. [2023-08-24 18:24:58,628 INFO L140 encePairwiseOnDemand]: 203/215 looper letters, 159 selfloop transitions, 19 changer transitions 0/221 dead transitions. [2023-08-24 18:24:58,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 221 transitions, 1212 flow [2023-08-24 18:24:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 18:24:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 18:24:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2023-08-24 18:24:58,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201550387596899 [2023-08-24 18:24:58,630 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2023-08-24 18:24:58,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2023-08-24 18:24:58,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:24:58,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2023-08-24 18:24:58,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:58,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:58,635 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:58,635 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 398 flow. Second operand 6 states and 542 transitions. [2023-08-24 18:24:58,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 221 transitions, 1212 flow [2023-08-24 18:24:59,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 221 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 18:24:59,817 INFO L231 Difference]: Finished difference. Result has 86 places, 117 transitions, 530 flow [2023-08-24 18:24:59,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=86, PETRI_TRANSITIONS=117} [2023-08-24 18:24:59,818 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -21 predicate places. [2023-08-24 18:24:59,818 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 117 transitions, 530 flow [2023-08-24 18:24:59,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:59,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:24:59,818 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 18:24:59,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 18:24:59,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err10ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:24:59,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:24:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1888316963, now seen corresponding path program 1 times [2023-08-24 18:24:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:24:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538691700] [2023-08-24 18:24:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:24:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:24:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:24:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 18:24:59,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:24:59,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538691700] [2023-08-24 18:24:59,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538691700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:24:59,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:24:59,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 18:24:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591826769] [2023-08-24 18:24:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:24:59,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 18:24:59,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:24:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 18:24:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 18:24:59,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 215 [2023-08-24 18:24:59,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 117 transitions, 530 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:24:59,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:24:59,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 215 [2023-08-24 18:24:59,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:25:28,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 7#L718true, 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:28,175 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 7#L718true, 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:28,176 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,176 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [120#L718-1true, 8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true]) [2023-08-24 18:25:28,202 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,202 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,202 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,202 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [120#L718-1true, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true]) [2023-08-24 18:25:28,203 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:28,203 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-24 18:25:28,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [120#L718-1true, 8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:31,591 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [120#L718-1true, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:31,591 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:25:31,591 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:25:31,592 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:25:31,592 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-24 18:25:32,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true]) [2023-08-24 18:25:32,501 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-24 18:25:32,502 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:25:32,502 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:25:32,502 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-24 18:25:35,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true]) [2023-08-24 18:25:35,273 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,274 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 112#L724true, thr1Thread4of4ForFork0InUse, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true]) [2023-08-24 18:25:35,276 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,276 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,276 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:35,276 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-08-24 18:25:36,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:36,031 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,031 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,031 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,031 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:36,032 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:36,032 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:36,032 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,032 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,033 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-24 18:25:36,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 7#L718true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:36,497 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,497 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,497 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,497 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 7#L718true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:36,498 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,498 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,498 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,498 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [120#L718-1true, 8#thr1Err10ASSERT_VIOLATIONASSERTtrue, 3#L722-1true, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true]) [2023-08-24 18:25:36,739 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [120#L718-1true, 3#L722-1true, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true]) [2023-08-24 18:25:36,740 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:36,740 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-24 18:25:38,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:38,610 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,610 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,610 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,610 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:38,611 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,611 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,612 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:38,612 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-24 18:25:39,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:39,129 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:39,130 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 112#L724true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), 13#L733-5true, Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:39,130 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,131 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [120#L718-1true, 8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:39,733 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [120#L718-1true, Black: 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:39,733 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:25:39,733 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-24 18:25:39,734 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:25:40,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true]) [2023-08-24 18:25:40,681 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-08-24 18:25:40,681 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:25:40,681 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:25:40,681 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-08-24 18:25:42,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true]) [2023-08-24 18:25:42,711 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,711 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,711 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,711 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 112#L724true, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true]) [2023-08-24 18:25:42,713 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,713 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,713 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:42,713 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2023-08-24 18:25:43,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:43,478 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,478 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,479 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,479 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 107#L724true, 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:43,479 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,479 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,479 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:43,493 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 3#L722-1true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true]) [2023-08-24 18:25:43,493 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,493 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:43,494 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-08-24 18:25:44,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 106#thr1EXITtrue, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:44,949 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,949 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,949 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,949 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, thr1Thread4of4ForFork0InUse, 112#L724true, 39#L722-1true, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 89#L722-2true]) [2023-08-24 18:25:44,951 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,951 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,951 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:44,951 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-24 18:25:45,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([938] L724-->thr1EXIT: Formula: (and (< (mod |v_thr1Thread1of4ForFork0_~v~0#1_21| 4294967296) (mod v_~value~0_204 4294967296)) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (= |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10| |v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|) (= |v_thr1Thread1of4ForFork0_#res#1.offset_13| 0) (= |v_#race~value~0_207| 0) (= |v_thr1Thread1of4ForFork0_#res#1.base_13| 0)) InVars {thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_10|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_10|, ~value~0=v_~value~0_204} OutVars{thr1Thread1of4ForFork0_#res#1.offset=|v_thr1Thread1of4ForFork0_#res#1.offset_13|, thr1Thread1of4ForFork0_~v~0#1=|v_thr1Thread1of4ForFork0_~v~0#1_21|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base_9|, ~value~0=v_~value~0_204, thr1Thread1of4ForFork0_#res#1.base=|v_thr1Thread1of4ForFork0_#res#1.base_13|, #race~value~0=|v_#race~value~0_207|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#res#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of4ForFork0_reach_error_#t~nondet0#1.base, thr1Thread1of4ForFork0_#res#1.base, #race~value~0][63], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), 107#L724true, Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 106#thr1EXITtrue, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:45,710 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,710 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,710 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,710 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([800] L724-->thr1Err10ASSERT_VIOLATIONASSERT: Formula: (and (<= (mod v_~value~0_26 4294967296) (mod |v_thr1Thread3of4ForFork0_~v~0#1_7| 4294967296)) (= |v_#race~value~0_31| 0)) InVars {~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|} OutVars{thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_1|, ~value~0=v_~value~0_26, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_7|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_1|, #race~value~0=|v_#race~value~0_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][109], [8#thr1Err10ASSERT_VIOLATIONASSERTtrue, Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:45,711 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L724-->thr1EXIT: Formula: (and (= |v_thr1Thread3of4ForFork0_#res#1.base_11| 0) (= |v_thr1Thread3of4ForFork0_#res#1.offset_11| 0) (= |v_#race~value~0_203| 0) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|) (< (mod |v_thr1Thread3of4ForFork0_~v~0#1_27| 4294967296) (mod v_~value~0_202 4294967296)) (= |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9| |v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|)) InVars {thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_10|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_10|} OutVars{thr1Thread3of4ForFork0_#res#1.offset=|v_thr1Thread3of4ForFork0_#res#1.offset_11|, thr1Thread3of4ForFork0_~v~0#1=|v_thr1Thread3of4ForFork0_~v~0#1_27|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_9|, thr1Thread3of4ForFork0_#res#1.base=|v_thr1Thread3of4ForFork0_#res#1.base_11|, ~value~0=v_~value~0_202, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_9|, #race~value~0=|v_#race~value~0_203|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_#res#1.offset, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_#res#1.base, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base, #race~value~0][110], [Black: 160#(= |thr1Thread1of4ForFork0_~v~0#1| 0), Black: 159#(= ~value~0 0), 148#true, Black: 163#(and (= |thr1Thread1of4ForFork0_~v~0#1| 0) (= ~value~0 0)), thr1Thread1of4ForFork0InUse, 174#(= |thr1Thread2of4ForFork0_~v~0#1| 0), thr1Thread2of4ForFork0InUse, 119#thr1EXITtrue, thr1Thread3of4ForFork0InUse, 25#L733-4true, 112#L724true, thr1Thread4of4ForFork0InUse, 165#(and (<= (+ |thr1Thread1of4ForFork0_~v~0#1| 1) ~value~0) (= |thr1Thread1of4ForFork0_~v~0#1| 0) (<= (div ~value~0 4294967296) (div |thr1Thread1of4ForFork0_~v~0#1| 4294967296))), Black: 151#true, 68#L722-2true, 89#L722-2true]) [2023-08-24 18:25:45,711 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:45,711 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-08-24 18:25:51,428 INFO L124 PetriNetUnfolderBase]: 583741/791814 cut-off events. [2023-08-24 18:25:51,429 INFO L125 PetriNetUnfolderBase]: For 441396/475018 co-relation queries the response was YES. [2023-08-24 18:25:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116014 conditions, 791814 events. 583741/791814 cut-off events. For 441396/475018 co-relation queries the response was YES. Maximal size of possible extension queue 29146. Compared 6688106 event pairs, 185916 based on Foata normal form. 1082/654206 useless extension candidates. Maximal degree in co-relation 2116001. Up to 375751 conditions per place. [2023-08-24 18:25:57,114 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 177 selfloop transitions, 31 changer transitions 0/251 dead transitions. [2023-08-24 18:25:57,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 251 transitions, 1529 flow [2023-08-24 18:25:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 18:25:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 18:25:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions. [2023-08-24 18:25:57,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2023-08-24 18:25:57,116 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 534 transitions. [2023-08-24 18:25:57,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions. [2023-08-24 18:25:57,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:25:57,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions. [2023-08-24 18:25:57,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:25:57,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:25:57,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:25:57,119 INFO L175 Difference]: Start difference. First operand has 86 places, 117 transitions, 530 flow. Second operand 6 states and 534 transitions. [2023-08-24 18:25:57,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 251 transitions, 1529 flow [2023-08-24 18:25:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 251 transitions, 1529 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 18:25:59,144 INFO L231 Difference]: Finished difference. Result has 93 places, 139 transitions, 807 flow [2023-08-24 18:25:59,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=807, PETRI_PLACES=93, PETRI_TRANSITIONS=139} [2023-08-24 18:25:59,144 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -14 predicate places. [2023-08-24 18:25:59,144 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 139 transitions, 807 flow [2023-08-24 18:25:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:25:59,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:25:59,145 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 18:25:59,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 18:25:59,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:25:59,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:25:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1124185575, now seen corresponding path program 1 times [2023-08-24 18:25:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:25:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409653458] [2023-08-24 18:25:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:25:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:25:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:25:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 18:25:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:25:59,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409653458] [2023-08-24 18:25:59,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409653458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:25:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:25:59,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 18:25:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57059620] [2023-08-24 18:25:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:25:59,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 18:25:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:25:59,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 18:25:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 18:25:59,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 215 [2023-08-24 18:25:59,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 139 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:25:59,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:25:59,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 215 [2023-08-24 18:25:59,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:26:01,595 INFO L124 PetriNetUnfolderBase]: 26270/39857 cut-off events. [2023-08-24 18:26:01,596 INFO L125 PetriNetUnfolderBase]: For 28300/28950 co-relation queries the response was YES. [2023-08-24 18:26:01,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111981 conditions, 39857 events. 26270/39857 cut-off events. For 28300/28950 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 293895 event pairs, 7746 based on Foata normal form. 3580/38525 useless extension candidates. Maximal degree in co-relation 111965. Up to 25922 conditions per place. [2023-08-24 18:26:01,961 INFO L140 encePairwiseOnDemand]: 203/215 looper letters, 61 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2023-08-24 18:26:01,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 702 flow [2023-08-24 18:26:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 18:26:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 18:26:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-24 18:26:01,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2023-08-24 18:26:01,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-24 18:26:01,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-24 18:26:01,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:26:01,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-24 18:26:01,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:01,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:01,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:01,964 INFO L175 Difference]: Start difference. First operand has 93 places, 139 transitions, 807 flow. Second operand 3 states and 280 transitions. [2023-08-24 18:26:01,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 702 flow [2023-08-24 18:26:02,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 690 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-24 18:26:02,062 INFO L231 Difference]: Finished difference. Result has 87 places, 92 transitions, 473 flow [2023-08-24 18:26:02,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2023-08-24 18:26:02,062 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -20 predicate places. [2023-08-24 18:26:02,062 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 473 flow [2023-08-24 18:26:02,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:02,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:26:02,063 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-24 18:26:02,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 18:26:02,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2023-08-24 18:26:02,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:26:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 340055654, now seen corresponding path program 1 times [2023-08-24 18:26:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:26:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755750862] [2023-08-24 18:26:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:26:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:26:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:26:02,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 18:26:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 18:26:02,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 18:26:02,076 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 18:26:02,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2023-08-24 18:26:02,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2023-08-24 18:26:02,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2023-08-24 18:26:02,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (44 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2023-08-24 18:26:02,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (33 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2023-08-24 18:26:02,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (22 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2023-08-24 18:26:02,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (11 of 56 remaining) [2023-08-24 18:26:02,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2023-08-24 18:26:02,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2023-08-24 18:26:02,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2023-08-24 18:26:02,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONASSERT (0 of 56 remaining) [2023-08-24 18:26:02,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 18:26:02,083 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-24 18:26:02,083 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 18:26:02,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-08-24 18:26:02,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 18:26:02,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,113 INFO L124 PetriNetUnfolderBase]: 11/228 cut-off events. [2023-08-24 18:26:02,114 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-24 18:26:02,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 228 events. 11/228 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 712 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 200. Up to 12 conditions per place. [2023-08-24 18:26:02,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,116 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 18:26:02,116 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,116 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 170 transitions, 385 flow [2023-08-24 18:26:02,128 INFO L124 PetriNetUnfolderBase]: 11/228 cut-off events. [2023-08-24 18:26:02,128 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-24 18:26:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 228 events. 11/228 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 712 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 200. Up to 12 conditions per place. [2023-08-24 18:26:02,136 INFO L119 LiptonReduction]: Number of co-enabled transitions 19880 [2023-08-24 18:26:03,634 INFO L134 LiptonReduction]: Checked pairs total: 136197 [2023-08-24 18:26:03,634 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-24 18:26:03,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 18:26:03,636 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@62492088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 18:26:03,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-08-24 18:26:03,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 18:26:03,636 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-24 18:26:03,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 18:26:03,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:26:03,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-24 18:26:03,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2023-08-24 18:26:03,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:26:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 39337284, now seen corresponding path program 1 times [2023-08-24 18:26:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:26:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381060224] [2023-08-24 18:26:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:26:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:26:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:26:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:26:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:26:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381060224] [2023-08-24 18:26:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381060224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:26:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:26:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 18:26:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570124129] [2023-08-24 18:26:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:26:03,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-24 18:26:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:26:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-24 18:26:03,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-24 18:26:03,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 254 [2023-08-24 18:26:03,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 126 transitions, 297 flow. Second operand has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:03,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:26:03,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 254 [2023-08-24 18:26:03,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 18:26:10,677 INFO L124 PetriNetUnfolderBase]: 81805/114903 cut-off events. [2023-08-24 18:26:10,677 INFO L125 PetriNetUnfolderBase]: For 27036/27036 co-relation queries the response was YES. [2023-08-24 18:26:10,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227277 conditions, 114903 events. 81805/114903 cut-off events. For 27036/27036 co-relation queries the response was YES. Maximal size of possible extension queue 4700. Compared 904931 event pairs, 66875 based on Foata normal form. 14930/104989 useless extension candidates. Maximal degree in co-relation 31689. Up to 100468 conditions per place. [2023-08-24 18:26:11,501 INFO L140 encePairwiseOnDemand]: 213/254 looper letters, 37 selfloop transitions, 0 changer transitions 0/85 dead transitions. [2023-08-24 18:26:11,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 289 flow [2023-08-24 18:26:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-24 18:26:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-24 18:26:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 264 transitions. [2023-08-24 18:26:11,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196850393700787 [2023-08-24 18:26:11,503 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 264 transitions. [2023-08-24 18:26:11,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 264 transitions. [2023-08-24 18:26:11,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 18:26:11,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 264 transitions. [2023-08-24 18:26:11,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:11,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:11,505 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:11,505 INFO L175 Difference]: Start difference. First operand has 132 places, 126 transitions, 297 flow. Second operand 2 states and 264 transitions. [2023-08-24 18:26:11,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 289 flow [2023-08-24 18:26:11,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 85 transitions, 269 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-24 18:26:11,515 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 195 flow [2023-08-24 18:26:11,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2023-08-24 18:26:11,515 INFO L281 CegarLoopForPetriNet]: 132 programPoint places, -40 predicate places. [2023-08-24 18:26:11,515 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 195 flow [2023-08-24 18:26:11,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:11,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 18:26:11,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 18:26:11,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 18:26:11,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2023-08-24 18:26:11,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 18:26:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -851541114, now seen corresponding path program 1 times [2023-08-24 18:26:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 18:26:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179443695] [2023-08-24 18:26:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 18:26:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 18:26:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 18:26:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 18:26:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 18:26:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179443695] [2023-08-24 18:26:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179443695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 18:26:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 18:26:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 18:26:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652014321] [2023-08-24 18:26:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 18:26:11,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 18:26:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 18:26:11,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 18:26:11,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 18:26:11,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 254 [2023-08-24 18:26:11,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 18:26:11,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 18:26:11,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 254 [2023-08-24 18:26:11,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand