/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/weaver/popl20-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 07:10:03,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 07:10:03,907 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-25 07:10:03,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 07:10:03,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 07:10:03,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 07:10:03,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 07:10:03,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 07:10:03,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 07:10:03,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 07:10:03,933 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 07:10:03,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 07:10:03,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 07:10:03,934 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 07:10:03,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 07:10:03,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 07:10:03,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 07:10:03,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 07:10:03,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 07:10:03,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 07:10:03,935 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 07:10:03,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 07:10:03,936 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 07:10:03,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 07:10:03,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 07:10:03,937 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 07:10:03,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 07:10:03,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:10:03,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 07:10:03,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 07:10:03,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 07:10:03,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 07:10:03,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 07:10:03,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 07:10:03,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 07:10:03,939 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-25 07:10:04,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 07:10:04,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 07:10:04,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 07:10:04,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 07:10:04,227 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 07:10:04,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-08-25 07:10:05,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 07:10:05,744 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 07:10:05,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2023-08-25 07:10:05,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1651bd6a/3b57b896b8b840a2869156d7bd58d37a/FLAGae1e28d2c [2023-08-25 07:10:05,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1651bd6a/3b57b896b8b840a2869156d7bd58d37a [2023-08-25 07:10:05,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 07:10:05,784 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 07:10:05,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 07:10:05,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 07:10:05,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 07:10:05,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:10:05" (1/1) ... [2023-08-25 07:10:05,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a95bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:05, skipping insertion in model container [2023-08-25 07:10:05,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:10:05" (1/1) ... [2023-08-25 07:10:05,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 07:10:06,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:10:06,028 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 07:10:06,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:10:06,061 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:10:06,061 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 07:10:06,069 INFO L206 MainTranslator]: Completed translation [2023-08-25 07:10:06,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06 WrapperNode [2023-08-25 07:10:06,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 07:10:06,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 07:10:06,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 07:10:06,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 07:10:06,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,130 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 381 [2023-08-25 07:10:06,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 07:10:06,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 07:10:06,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 07:10:06,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 07:10:06,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 07:10:06,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 07:10:06,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 07:10:06,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 07:10:06,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (1/1) ... [2023-08-25 07:10:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:10:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:10:06,218 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-25 07:10:06,242 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-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 07:10:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 07:10:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 07:10:06,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 07:10:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 07:10:06,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 07:10:06,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 07:10:06,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 07:10:06,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 07:10:06,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 07:10:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 07:10:06,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 07:10:06,272 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 07:10:06,353 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 07:10:06,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 07:10:07,004 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 07:10:07,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 07:10:07,166 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 07:10:07,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:10:07 BoogieIcfgContainer [2023-08-25 07:10:07,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 07:10:07,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 07:10:07,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 07:10:07,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 07:10:07,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:10:05" (1/3) ... [2023-08-25 07:10:07,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263b3805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:10:07, skipping insertion in model container [2023-08-25 07:10:07,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:10:06" (2/3) ... [2023-08-25 07:10:07,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263b3805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:10:07, skipping insertion in model container [2023-08-25 07:10:07,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:10:07" (3/3) ... [2023-08-25 07:10:07,176 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2023-08-25 07:10:07,188 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 07:10:07,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-08-25 07:10:07,189 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 07:10:07,277 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 07:10:07,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 489 places, 506 transitions, 1036 flow [2023-08-25 07:10:07,409 INFO L124 PetriNetUnfolderBase]: 27/503 cut-off events. [2023-08-25 07:10:07,410 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:10:07,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 27/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 651 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-25 07:10:07,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 506 transitions, 1036 flow [2023-08-25 07:10:07,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 475 places, 492 transitions, 1002 flow [2023-08-25 07:10:07,434 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 07:10:07,443 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-25 07:10:07,446 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-25 07:10:07,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 492 transitions, 1002 flow [2023-08-25 07:10:07,521 INFO L124 PetriNetUnfolderBase]: 27/492 cut-off events. [2023-08-25 07:10:07,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 07:10:07,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 492 events. 27/492 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 652 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-25 07:10:07,530 INFO L119 LiptonReduction]: Number of co-enabled transitions 14004 [2023-08-25 07:10:38,735 INFO L134 LiptonReduction]: Checked pairs total: 116695 [2023-08-25 07:10:38,735 INFO L136 LiptonReduction]: Total number of compositions: 512 [2023-08-25 07:10:38,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 07:10:38,755 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;@4bc0fee2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 07:10:38,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-08-25 07:10:38,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 07:10:38,757 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 07:10:38,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 07:10:38,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:38,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 07:10:38,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:38,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1982, now seen corresponding path program 1 times [2023-08-25 07:10:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188927442] [2023-08-25 07:10:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:38,836 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-25 07:10:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188927442] [2023-08-25 07:10:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188927442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 07:10:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720961405] [2023-08-25 07:10:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:38,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 07:10:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 07:10:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 07:10:38,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 1018 [2023-08-25 07:10:38,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 144 transitions, 306 flow. Second operand has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 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-25 07:10:38,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:38,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 1018 [2023-08-25 07:10:38,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:39,336 INFO L124 PetriNetUnfolderBase]: 1139/2880 cut-off events. [2023-08-25 07:10:39,336 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-25 07:10:39,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 2880 events. 1139/2880 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22220 event pairs, 599 based on Foata normal form. 437/2712 useless extension candidates. Maximal degree in co-relation 4044. Up to 1506 conditions per place. [2023-08-25 07:10:39,352 INFO L140 encePairwiseOnDemand]: 972/1018 looper letters, 36 selfloop transitions, 0 changer transitions 0/98 dead transitions. [2023-08-25 07:10:39,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 286 flow [2023-08-25 07:10:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 07:10:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 07:10:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1010 transitions. [2023-08-25 07:10:39,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960707269155206 [2023-08-25 07:10:39,367 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1010 transitions. [2023-08-25 07:10:39,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1010 transitions. [2023-08-25 07:10:39,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:39,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1010 transitions. [2023-08-25 07:10:39,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 505.0) internal successors, (1010), 2 states have internal predecessors, (1010), 0 states have call successors, (0), 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-25 07:10:39,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 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-25 07:10:39,382 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 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-25 07:10:39,383 INFO L175 Difference]: Start difference. First operand has 142 places, 144 transitions, 306 flow. Second operand 2 states and 1010 transitions. [2023-08-25 07:10:39,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 286 flow [2023-08-25 07:10:39,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 07:10:39,388 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 202 flow [2023-08-25 07:10:39,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=202, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2023-08-25 07:10:39,392 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-25 07:10:39,392 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 202 flow [2023-08-25 07:10:39,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 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-25 07:10:39,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:39,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:39,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 07:10:39,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:39,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1131874658, now seen corresponding path program 1 times [2023-08-25 07:10:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852324196] [2023-08-25 07:10:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:39,589 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-25 07:10:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852324196] [2023-08-25 07:10:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852324196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:39,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:39,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:10:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794158185] [2023-08-25 07:10:39,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:10:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:10:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:10:39,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 1018 [2023-08-25 07:10:39,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 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-25 07:10:39,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:39,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 1018 [2023-08-25 07:10:39,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:39,953 INFO L124 PetriNetUnfolderBase]: 2055/4529 cut-off events. [2023-08-25 07:10:39,953 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-25 07:10:39,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4529 events. 2055/4529 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 33591 event pairs, 1462 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 7426. Up to 2836 conditions per place. [2023-08-25 07:10:39,971 INFO L140 encePairwiseOnDemand]: 1014/1018 looper letters, 39 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2023-08-25 07:10:39,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 276 flow [2023-08-25 07:10:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:10:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:10:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2023-08-25 07:10:39,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44629993451211525 [2023-08-25 07:10:39,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2023-08-25 07:10:39,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2023-08-25 07:10:39,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:39,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2023-08-25 07:10:39,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:10:39,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:39,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:39,982 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 202 flow. Second operand 3 states and 1363 transitions. [2023-08-25 07:10:39,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 276 flow [2023-08-25 07:10:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:10:39,986 INFO L231 Difference]: Finished difference. Result has 93 places, 95 transitions, 198 flow [2023-08-25 07:10:39,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=95} [2023-08-25 07:10:39,987 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -49 predicate places. [2023-08-25 07:10:39,987 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 95 transitions, 198 flow [2023-08-25 07:10:39,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 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-25 07:10:39,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:39,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:39,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 07:10:39,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:39,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1105207622, now seen corresponding path program 1 times [2023-08-25 07:10:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414878877] [2023-08-25 07:10:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:40,094 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-25 07:10:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414878877] [2023-08-25 07:10:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414878877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:40,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:40,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:10:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278699635] [2023-08-25 07:10:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:40,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:10:40,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:10:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:10:40,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-25 07:10:40,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 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-25 07:10:40,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:40,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-25 07:10:40,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:40,415 INFO L124 PetriNetUnfolderBase]: 1507/3592 cut-off events. [2023-08-25 07:10:40,415 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 07:10:40,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 3592 events. 1507/3592 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 28062 event pairs, 828 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 5635. Up to 1987 conditions per place. [2023-08-25 07:10:40,434 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 38 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-08-25 07:10:40,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 272 flow [2023-08-25 07:10:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:10:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:10:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-25 07:10:40,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-25 07:10:40,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-25 07:10:40,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-25 07:10:40,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:40,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-25 07:10:40,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 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-25 07:10:40,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:40,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:40,444 INFO L175 Difference]: Start difference. First operand has 93 places, 95 transitions, 198 flow. Second operand 3 states and 1388 transitions. [2023-08-25 07:10:40,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 272 flow [2023-08-25 07:10:40,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:10:40,448 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 195 flow [2023-08-25 07:10:40,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2023-08-25 07:10:40,449 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -50 predicate places. [2023-08-25 07:10:40,449 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 195 flow [2023-08-25 07:10:40,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 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-25 07:10:40,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:40,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:40,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 07:10:40,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:40,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 796348320, now seen corresponding path program 1 times [2023-08-25 07:10:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809258743] [2023-08-25 07:10:40,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:40,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:40,635 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-25 07:10:40,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809258743] [2023-08-25 07:10:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809258743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:10:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774698337] [2023-08-25 07:10:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:40,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:10:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:10:40,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:10:40,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 1018 [2023-08-25 07:10:40,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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-25 07:10:40,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:40,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 1018 [2023-08-25 07:10:40,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:41,000 INFO L124 PetriNetUnfolderBase]: 1139/2775 cut-off events. [2023-08-25 07:10:41,000 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 07:10:41,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 2775 events. 1139/2775 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20797 event pairs, 599 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4320. Up to 1506 conditions per place. [2023-08-25 07:10:41,013 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 35 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-25 07:10:41,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 271 flow [2023-08-25 07:10:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:10:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:10:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2023-08-25 07:10:41,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151931892599869 [2023-08-25 07:10:41,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1268 transitions. [2023-08-25 07:10:41,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1268 transitions. [2023-08-25 07:10:41,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:41,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1268 transitions. [2023-08-25 07:10:41,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 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-25 07:10:41,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:41,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:41,025 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 195 flow. Second operand 3 states and 1268 transitions. [2023-08-25 07:10:41,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 271 flow [2023-08-25 07:10:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:10:41,027 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 206 flow [2023-08-25 07:10:41,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2023-08-25 07:10:41,030 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-25 07:10:41,030 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 206 flow [2023-08-25 07:10:41,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 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-25 07:10:41,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:41,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:41,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 07:10:41,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:41,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 532974789, now seen corresponding path program 1 times [2023-08-25 07:10:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685859241] [2023-08-25 07:10:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:10:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685859241] [2023-08-25 07:10:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685859241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 07:10:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961640163] [2023-08-25 07:10:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 07:10:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 07:10:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 07:10:41,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 1018 [2023-08-25 07:10:41,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 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-25 07:10:41,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:41,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 1018 [2023-08-25 07:10:41,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:41,479 INFO L124 PetriNetUnfolderBase]: 1139/2777 cut-off events. [2023-08-25 07:10:41,479 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 07:10:41,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2777 events. 1139/2777 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20772 event pairs, 599 based on Foata normal form. 0/2195 useless extension candidates. Maximal degree in co-relation 4329. Up to 1505 conditions per place. [2023-08-25 07:10:41,492 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 33 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2023-08-25 07:10:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 288 flow [2023-08-25 07:10:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 07:10:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 07:10:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1633 transitions. [2023-08-25 07:10:41,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40103143418467585 [2023-08-25 07:10:41,496 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1633 transitions. [2023-08-25 07:10:41,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1633 transitions. [2023-08-25 07:10:41,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:41,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1633 transitions. [2023-08-25 07:10:41,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 408.25) internal successors, (1633), 4 states have internal predecessors, (1633), 0 states have call successors, (0), 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-25 07:10:41,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 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-25 07:10:41,505 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 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-25 07:10:41,505 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 206 flow. Second operand 4 states and 1633 transitions. [2023-08-25 07:10:41,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 288 flow [2023-08-25 07:10:41,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 284 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 07:10:41,507 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 230 flow [2023-08-25 07:10:41,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-25 07:10:41,508 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -45 predicate places. [2023-08-25 07:10:41,508 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 230 flow [2023-08-25 07:10:41,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 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-25 07:10:41,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:41,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:41,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 07:10:41,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:41,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -343018578, now seen corresponding path program 1 times [2023-08-25 07:10:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322142736] [2023-08-25 07:10:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:10:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322142736] [2023-08-25 07:10:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322142736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:10:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223999038] [2023-08-25 07:10:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:41,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:10:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:10:41,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:10:41,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-25 07:10:41,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 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-25 07:10:41,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:41,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-25 07:10:41,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:44,745 INFO L124 PetriNetUnfolderBase]: 18088/24524 cut-off events. [2023-08-25 07:10:44,745 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-25 07:10:44,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48031 conditions, 24524 events. 18088/24524 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 144945 event pairs, 5719 based on Foata normal form. 0/19471 useless extension candidates. Maximal degree in co-relation 48025. Up to 13554 conditions per place. [2023-08-25 07:10:44,864 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 236 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2023-08-25 07:10:44,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 265 transitions, 1061 flow [2023-08-25 07:10:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:10:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:10:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2023-08-25 07:10:44,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071709233791749 [2023-08-25 07:10:44,869 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2487 transitions. [2023-08-25 07:10:44,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2487 transitions. [2023-08-25 07:10:44,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:44,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2487 transitions. [2023-08-25 07:10:44,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 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-25 07:10:44,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:10:44,880 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:10:44,880 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 230 flow. Second operand 6 states and 2487 transitions. [2023-08-25 07:10:44,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 265 transitions, 1061 flow [2023-08-25 07:10:44,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 265 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:10:44,883 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 293 flow [2023-08-25 07:10:44,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2023-08-25 07:10:44,884 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -36 predicate places. [2023-08-25 07:10:44,884 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 293 flow [2023-08-25 07:10:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 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-25 07:10:44,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:44,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:44,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 07:10:44,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:44,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1021553860, now seen corresponding path program 1 times [2023-08-25 07:10:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837981760] [2023-08-25 07:10:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837981760] [2023-08-25 07:10:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837981760] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:10:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252572955] [2023-08-25 07:10:44,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:45,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:10:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:10:45,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:10:45,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 07:10:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:45,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 07:10:45,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:10:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:45,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:10:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252572955] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:10:45,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:10:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-25 07:10:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054060423] [2023-08-25 07:10:45,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:10:45,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 07:10:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:45,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 07:10:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-25 07:10:45,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 07:10:45,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 293 flow. Second operand has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 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-25 07:10:45,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:45,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 07:10:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:45,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 07:10:45,932 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 07:10:45,932 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 07:10:45,932 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 07:10:45,932 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 07:10:45,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 07:10:45,933 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 07:10:45,933 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 07:10:45,933 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 07:10:45,933 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 07:10:46,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 532#(<= ~N~0 1)]) [2023-08-25 07:10:46,091 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,091 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 07:10:46,091 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,091 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 07:10:46,092 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,092 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,092 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 07:10:46,092 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))]) [2023-08-25 07:10:46,093 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 07:10:46,093 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 07:10:46,093 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 07:10:47,361 INFO L124 PetriNetUnfolderBase]: 10452/15700 cut-off events. [2023-08-25 07:10:47,361 INFO L125 PetriNetUnfolderBase]: For 7571/8309 co-relation queries the response was YES. [2023-08-25 07:10:47,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 15700 events. 10452/15700 cut-off events. For 7571/8309 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 104666 event pairs, 5381 based on Foata normal form. 2/12452 useless extension candidates. Maximal degree in co-relation 35779. Up to 12548 conditions per place. [2023-08-25 07:10:47,454 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 103 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-08-25 07:10:47,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 161 transitions, 744 flow [2023-08-25 07:10:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:10:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:10:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3408 transitions. [2023-08-25 07:10:47,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719711853307138 [2023-08-25 07:10:47,460 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3408 transitions. [2023-08-25 07:10:47,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3408 transitions. [2023-08-25 07:10:47,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:47,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3408 transitions. [2023-08-25 07:10:47,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 378.6666666666667) internal successors, (3408), 9 states have internal predecessors, (3408), 0 states have call successors, (0), 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-25 07:10:47,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:10:47,474 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:10:47,474 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 293 flow. Second operand 9 states and 3408 transitions. [2023-08-25 07:10:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 161 transitions, 744 flow [2023-08-25 07:10:47,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 161 transitions, 744 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:10:47,487 INFO L231 Difference]: Finished difference. Result has 118 places, 120 transitions, 448 flow [2023-08-25 07:10:47,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=118, PETRI_TRANSITIONS=120} [2023-08-25 07:10:47,488 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -24 predicate places. [2023-08-25 07:10:47,488 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 448 flow [2023-08-25 07:10:47,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 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-25 07:10:47,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:47,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:47,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 07:10:47,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:10:47,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:47,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1391896879, now seen corresponding path program 1 times [2023-08-25 07:10:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:47,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692939564] [2023-08-25 07:10:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692939564] [2023-08-25 07:10:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692939564] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:10:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744380156] [2023-08-25 07:10:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:47,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:10:47,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:10:47,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:10:47,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 07:10:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:48,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 07:10:48,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:10:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:48,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:10:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 07:10:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744380156] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:10:48,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:10:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-25 07:10:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631681161] [2023-08-25 07:10:48,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:10:48,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 07:10:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 07:10:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-25 07:10:48,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 1018 [2023-08-25 07:10:48,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 448 flow. Second operand has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 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-25 07:10:48,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:48,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 1018 [2023-08-25 07:10:48,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:49,009 INFO L124 PetriNetUnfolderBase]: 2836/6491 cut-off events. [2023-08-25 07:10:49,010 INFO L125 PetriNetUnfolderBase]: For 1632/1702 co-relation queries the response was YES. [2023-08-25 07:10:49,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 6491 events. 2836/6491 cut-off events. For 1632/1702 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 54120 event pairs, 1472 based on Foata normal form. 112/5256 useless extension candidates. Maximal degree in co-relation 12286. Up to 3405 conditions per place. [2023-08-25 07:10:49,049 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 69 selfloop transitions, 22 changer transitions 0/152 dead transitions. [2023-08-25 07:10:49,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 152 transitions, 718 flow [2023-08-25 07:10:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:10:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:10:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3634 transitions. [2023-08-25 07:10:49,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39663828858327876 [2023-08-25 07:10:49,056 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3634 transitions. [2023-08-25 07:10:49,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3634 transitions. [2023-08-25 07:10:49,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:49,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3634 transitions. [2023-08-25 07:10:49,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 403.77777777777777) internal successors, (3634), 9 states have internal predecessors, (3634), 0 states have call successors, (0), 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-25 07:10:49,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:10:49,070 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:10:49,070 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 448 flow. Second operand 9 states and 3634 transitions. [2023-08-25 07:10:49,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 152 transitions, 718 flow [2023-08-25 07:10:49,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 152 transitions, 690 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-25 07:10:49,079 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 489 flow [2023-08-25 07:10:49,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2023-08-25 07:10:49,079 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -15 predicate places. [2023-08-25 07:10:49,079 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 489 flow [2023-08-25 07:10:49,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 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-25 07:10:49,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:49,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:49,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 07:10:49,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-08-25 07:10:49,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:49,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1399204042, now seen corresponding path program 2 times [2023-08-25 07:10:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478222822] [2023-08-25 07:10:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:10:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478222822] [2023-08-25 07:10:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478222822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:10:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074728046] [2023-08-25 07:10:49,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:10:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:10:49,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:10:49,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 07:10:49,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 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-25 07:10:49,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:49,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 07:10:49,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:54,785 INFO L124 PetriNetUnfolderBase]: 32994/46701 cut-off events. [2023-08-25 07:10:54,786 INFO L125 PetriNetUnfolderBase]: For 37782/38322 co-relation queries the response was YES. [2023-08-25 07:10:55,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120330 conditions, 46701 events. 32994/46701 cut-off events. For 37782/38322 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 307531 event pairs, 6905 based on Foata normal form. 280/38880 useless extension candidates. Maximal degree in co-relation 120312. Up to 24395 conditions per place. [2023-08-25 07:10:55,174 INFO L140 encePairwiseOnDemand]: 1002/1018 looper letters, 207 selfloop transitions, 33 changer transitions 0/256 dead transitions. [2023-08-25 07:10:55,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 256 transitions, 1485 flow [2023-08-25 07:10:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:10:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:10:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2378 transitions. [2023-08-25 07:10:55,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3893254747871644 [2023-08-25 07:10:55,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2378 transitions. [2023-08-25 07:10:55,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2378 transitions. [2023-08-25 07:10:55,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:55,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2378 transitions. [2023-08-25 07:10:55,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 0 states have call successors, (0), 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-25 07:10:55,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:10:55,192 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:10:55,192 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 489 flow. Second operand 6 states and 2378 transitions. [2023-08-25 07:10:55,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 256 transitions, 1485 flow [2023-08-25 07:10:55,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 256 transitions, 1448 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 07:10:55,335 INFO L231 Difference]: Finished difference. Result has 131 places, 154 transitions, 798 flow [2023-08-25 07:10:55,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=131, PETRI_TRANSITIONS=154} [2023-08-25 07:10:55,335 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -11 predicate places. [2023-08-25 07:10:55,336 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 154 transitions, 798 flow [2023-08-25 07:10:55,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 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-25 07:10:55,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:55,336 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:55,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 07:10:55,336 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:55,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash 425666570, now seen corresponding path program 1 times [2023-08-25 07:10:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:55,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718804007] [2023-08-25 07:10:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:10:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718804007] [2023-08-25 07:10:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718804007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:10:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136267595] [2023-08-25 07:10:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:10:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:10:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:10:55,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 1018 [2023-08-25 07:10:55,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 154 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 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-25 07:10:55,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:55,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 1018 [2023-08-25 07:10:55,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:10:57,773 INFO L124 PetriNetUnfolderBase]: 9971/19279 cut-off events. [2023-08-25 07:10:57,788 INFO L125 PetriNetUnfolderBase]: For 42941/45595 co-relation queries the response was YES. [2023-08-25 07:10:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55471 conditions, 19279 events. 9971/19279 cut-off events. For 42941/45595 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 166181 event pairs, 1634 based on Foata normal form. 106/16100 useless extension candidates. Maximal degree in co-relation 55449. Up to 7026 conditions per place. [2023-08-25 07:10:57,972 INFO L140 encePairwiseOnDemand]: 1013/1018 looper letters, 128 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2023-08-25 07:10:57,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 1427 flow [2023-08-25 07:10:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:10:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:10:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1417 transitions. [2023-08-25 07:10:57,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639816633922724 [2023-08-25 07:10:57,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1417 transitions. [2023-08-25 07:10:57,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1417 transitions. [2023-08-25 07:10:57,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:10:57,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1417 transitions. [2023-08-25 07:10:57,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 472.3333333333333) internal successors, (1417), 3 states have internal predecessors, (1417), 0 states have call successors, (0), 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-25 07:10:58,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:58,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:10:58,011 INFO L175 Difference]: Start difference. First operand has 131 places, 154 transitions, 798 flow. Second operand 3 states and 1417 transitions. [2023-08-25 07:10:58,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 204 transitions, 1427 flow [2023-08-25 07:10:58,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 204 transitions, 1427 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 07:10:58,049 INFO L231 Difference]: Finished difference. Result has 133 places, 158 transitions, 849 flow [2023-08-25 07:10:58,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=133, PETRI_TRANSITIONS=158} [2023-08-25 07:10:58,050 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -9 predicate places. [2023-08-25 07:10:58,050 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 158 transitions, 849 flow [2023-08-25 07:10:58,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 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-25 07:10:58,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:10:58,051 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:10:58,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 07:10:58,051 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:10:58,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:10:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 310768637, now seen corresponding path program 1 times [2023-08-25 07:10:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:10:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390266109] [2023-08-25 07:10:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:10:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:10:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:10:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:10:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:10:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390266109] [2023-08-25 07:10:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390266109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:10:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:10:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:10:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728087315] [2023-08-25 07:10:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:10:58,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:10:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:10:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:10:58,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:10:58,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-25 07:10:58,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 158 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 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-25 07:10:58,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:10:58,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-25 07:10:58,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:00,684 INFO L124 PetriNetUnfolderBase]: 11468/21453 cut-off events. [2023-08-25 07:11:00,684 INFO L125 PetriNetUnfolderBase]: For 52019/54635 co-relation queries the response was YES. [2023-08-25 07:11:00,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63346 conditions, 21453 events. 11468/21453 cut-off events. For 52019/54635 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 183061 event pairs, 4364 based on Foata normal form. 106/18443 useless extension candidates. Maximal degree in co-relation 63323. Up to 14036 conditions per place. [2023-08-25 07:11:00,953 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 88 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-08-25 07:11:00,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 156 transitions, 1029 flow [2023-08-25 07:11:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:11:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:11:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-25 07:11:00,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-25 07:11:00,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-25 07:11:00,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-25 07:11:00,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:00,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-25 07:11:00,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 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-25 07:11:00,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:11:00,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 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-25 07:11:00,962 INFO L175 Difference]: Start difference. First operand has 133 places, 158 transitions, 849 flow. Second operand 3 states and 1388 transitions. [2023-08-25 07:11:00,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 156 transitions, 1029 flow [2023-08-25 07:11:00,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 1022 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:11:01,000 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 846 flow [2023-08-25 07:11:01,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2023-08-25 07:11:01,000 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -10 predicate places. [2023-08-25 07:11:01,000 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 846 flow [2023-08-25 07:11:01,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 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-25 07:11:01,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:01,001 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 07:11:01,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:11:01,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -610811521, now seen corresponding path program 2 times [2023-08-25 07:11:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:01,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425102652] [2023-08-25 07:11:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:11:02,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425102652] [2023-08-25 07:11:02,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425102652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:02,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:02,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 07:11:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812618610] [2023-08-25 07:11:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 07:11:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 07:11:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-25 07:11:02,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 1018 [2023-08-25 07:11:02,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 846 flow. Second operand has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 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-25 07:11:02,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:02,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 1018 [2023-08-25 07:11:02,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:10,590 INFO L124 PetriNetUnfolderBase]: 45996/63477 cut-off events. [2023-08-25 07:11:10,590 INFO L125 PetriNetUnfolderBase]: For 85499/86534 co-relation queries the response was YES. [2023-08-25 07:11:11,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190491 conditions, 63477 events. 45996/63477 cut-off events. For 85499/86534 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 414899 event pairs, 6116 based on Foata normal form. 1392/55775 useless extension candidates. Maximal degree in co-relation 190467. Up to 21058 conditions per place. [2023-08-25 07:11:11,417 INFO L140 encePairwiseOnDemand]: 1012/1018 looper letters, 384 selfloop transitions, 8 changer transitions 0/407 dead transitions. [2023-08-25 07:11:11,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 407 transitions, 2786 flow [2023-08-25 07:11:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 07:11:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 07:11:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2635 transitions. [2023-08-25 07:11:11,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36977266348582655 [2023-08-25 07:11:11,423 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2635 transitions. [2023-08-25 07:11:11,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2635 transitions. [2023-08-25 07:11:11,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:11,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2635 transitions. [2023-08-25 07:11:11,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 376.42857142857144) internal successors, (2635), 7 states have internal predecessors, (2635), 0 states have call successors, (0), 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-25 07:11:11,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 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-25 07:11:11,433 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 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-25 07:11:11,434 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 846 flow. Second operand 7 states and 2635 transitions. [2023-08-25 07:11:11,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 407 transitions, 2786 flow [2023-08-25 07:11:12,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 407 transitions, 2775 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:11:12,230 INFO L231 Difference]: Finished difference. Result has 135 places, 155 transitions, 847 flow [2023-08-25 07:11:12,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=135, PETRI_TRANSITIONS=155} [2023-08-25 07:11:12,230 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -7 predicate places. [2023-08-25 07:11:12,231 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 155 transitions, 847 flow [2023-08-25 07:11:12,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 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-25 07:11:12,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:12,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 07:11:12,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:11:12,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1111436342, now seen corresponding path program 1 times [2023-08-25 07:11:12,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:12,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012891852] [2023-08-25 07:11:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:11:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012891852] [2023-08-25 07:11:12,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012891852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:12,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:12,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:11:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810131678] [2023-08-25 07:11:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:12,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:11:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:11:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:11:12,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-25 07:11:12,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 155 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 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-25 07:11:12,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:12,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-25 07:11:12,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:19,286 INFO L124 PetriNetUnfolderBase]: 41312/58702 cut-off events. [2023-08-25 07:11:19,286 INFO L125 PetriNetUnfolderBase]: For 100138/100585 co-relation queries the response was YES. [2023-08-25 07:11:19,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179117 conditions, 58702 events. 41312/58702 cut-off events. For 100138/100585 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 389520 event pairs, 20700 based on Foata normal form. 272/50622 useless extension candidates. Maximal degree in co-relation 179094. Up to 52520 conditions per place. [2023-08-25 07:11:19,751 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 173 selfloop transitions, 13 changer transitions 0/205 dead transitions. [2023-08-25 07:11:19,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 1401 flow [2023-08-25 07:11:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:11:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:11:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2023-08-25 07:11:19,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38605108055009824 [2023-08-25 07:11:19,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2358 transitions. [2023-08-25 07:11:19,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2358 transitions. [2023-08-25 07:11:19,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:19,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2358 transitions. [2023-08-25 07:11:19,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.0) internal successors, (2358), 6 states have internal predecessors, (2358), 0 states have call successors, (0), 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-25 07:11:19,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:11:19,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:11:19,764 INFO L175 Difference]: Start difference. First operand has 135 places, 155 transitions, 847 flow. Second operand 6 states and 2358 transitions. [2023-08-25 07:11:19,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 1401 flow [2023-08-25 07:11:19,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 205 transitions, 1387 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 07:11:19,883 INFO L231 Difference]: Finished difference. Result has 140 places, 167 transitions, 975 flow [2023-08-25 07:11:19,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=140, PETRI_TRANSITIONS=167} [2023-08-25 07:11:19,884 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -2 predicate places. [2023-08-25 07:11:19,884 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 975 flow [2023-08-25 07:11:19,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 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-25 07:11:19,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:19,885 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:19,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 07:11:19,885 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:11:19,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1032675538, now seen corresponding path program 1 times [2023-08-25 07:11:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730428401] [2023-08-25 07:11:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:11:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730428401] [2023-08-25 07:11:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730428401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:11:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743768086] [2023-08-25 07:11:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:20,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 07:11:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 07:11:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:11:20,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-25 07:11:20,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 975 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 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-25 07:11:20,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:20,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-25 07:11:20,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:33,139 INFO L124 PetriNetUnfolderBase]: 81161/113767 cut-off events. [2023-08-25 07:11:33,140 INFO L125 PetriNetUnfolderBase]: For 172105/173633 co-relation queries the response was YES. [2023-08-25 07:11:33,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337435 conditions, 113767 events. 81161/113767 cut-off events. For 172105/173633 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 769633 event pairs, 16189 based on Foata normal form. 537/98281 useless extension candidates. Maximal degree in co-relation 337408. Up to 36354 conditions per place. [2023-08-25 07:11:34,561 INFO L140 encePairwiseOnDemand]: 1003/1018 looper letters, 371 selfloop transitions, 76 changer transitions 0/458 dead transitions. [2023-08-25 07:11:34,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 458 transitions, 3756 flow [2023-08-25 07:11:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 07:11:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 07:11:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3869 transitions. [2023-08-25 07:11:34,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.345508126451152 [2023-08-25 07:11:34,578 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3869 transitions. [2023-08-25 07:11:34,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3869 transitions. [2023-08-25 07:11:34,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:34,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3869 transitions. [2023-08-25 07:11:34,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 351.72727272727275) internal successors, (3869), 11 states have internal predecessors, (3869), 0 states have call successors, (0), 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-25 07:11:34,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 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-25 07:11:34,597 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 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-25 07:11:34,597 INFO L175 Difference]: Start difference. First operand has 140 places, 167 transitions, 975 flow. Second operand 11 states and 3869 transitions. [2023-08-25 07:11:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 458 transitions, 3756 flow [2023-08-25 07:11:35,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 458 transitions, 3740 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-25 07:11:35,522 INFO L231 Difference]: Finished difference. Result has 153 places, 222 transitions, 1766 flow [2023-08-25 07:11:35,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1766, PETRI_PLACES=153, PETRI_TRANSITIONS=222} [2023-08-25 07:11:35,523 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 11 predicate places. [2023-08-25 07:11:35,523 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 222 transitions, 1766 flow [2023-08-25 07:11:35,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 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-25 07:11:35,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:35,524 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:35,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 07:11:35,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:11:35,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1041916758, now seen corresponding path program 2 times [2023-08-25 07:11:35,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095012143] [2023-08-25 07:11:35,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:11:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095012143] [2023-08-25 07:11:36,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095012143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:36,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:36,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:11:36,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844651481] [2023-08-25 07:11:36,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:36,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 07:11:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:36,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 07:11:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-25 07:11:36,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-25 07:11:36,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 222 transitions, 1766 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 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-25 07:11:36,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:36,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-25 07:11:36,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:11:54,215 INFO L124 PetriNetUnfolderBase]: 98370/137209 cut-off events. [2023-08-25 07:11:54,215 INFO L125 PetriNetUnfolderBase]: For 446564/448372 co-relation queries the response was YES. [2023-08-25 07:11:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477230 conditions, 137209 events. 98370/137209 cut-off events. For 446564/448372 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 930868 event pairs, 20113 based on Foata normal form. 282/119296 useless extension candidates. Maximal degree in co-relation 477198. Up to 73990 conditions per place. [2023-08-25 07:11:56,095 INFO L140 encePairwiseOnDemand]: 1004/1018 looper letters, 309 selfloop transitions, 160 changer transitions 0/480 dead transitions. [2023-08-25 07:11:56,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 480 transitions, 4637 flow [2023-08-25 07:11:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 07:11:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 07:11:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3868 transitions. [2023-08-25 07:11:56,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3454188247901411 [2023-08-25 07:11:56,100 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3868 transitions. [2023-08-25 07:11:56,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3868 transitions. [2023-08-25 07:11:56,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:11:56,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3868 transitions. [2023-08-25 07:11:56,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 351.6363636363636) internal successors, (3868), 11 states have internal predecessors, (3868), 0 states have call successors, (0), 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-25 07:11:56,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 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-25 07:11:56,156 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 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-25 07:11:56,156 INFO L175 Difference]: Start difference. First operand has 153 places, 222 transitions, 1766 flow. Second operand 11 states and 3868 transitions. [2023-08-25 07:11:56,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 480 transitions, 4637 flow [2023-08-25 07:11:59,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 480 transitions, 4601 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-25 07:11:59,237 INFO L231 Difference]: Finished difference. Result has 163 places, 316 transitions, 3615 flow [2023-08-25 07:11:59,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=1730, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3615, PETRI_PLACES=163, PETRI_TRANSITIONS=316} [2023-08-25 07:11:59,237 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 21 predicate places. [2023-08-25 07:11:59,237 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 316 transitions, 3615 flow [2023-08-25 07:11:59,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 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-25 07:11:59,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:11:59,238 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:11:59,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 07:11:59,238 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:11:59,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:11:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash -753888379, now seen corresponding path program 1 times [2023-08-25 07:11:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:11:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659864337] [2023-08-25 07:11:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:11:59,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:11:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:11:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:11:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:11:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659864337] [2023-08-25 07:11:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659864337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:11:59,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:11:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:11:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91450713] [2023-08-25 07:11:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:11:59,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:11:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:11:59,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:11:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:11:59,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 07:11:59,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 316 transitions, 3615 flow. Second operand has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 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-25 07:11:59,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:11:59,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 07:11:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:19,067 INFO L124 PetriNetUnfolderBase]: 101294/141428 cut-off events. [2023-08-25 07:12:19,067 INFO L125 PetriNetUnfolderBase]: For 756866/761077 co-relation queries the response was YES. [2023-08-25 07:12:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541929 conditions, 141428 events. 101294/141428 cut-off events. For 756866/761077 co-relation queries the response was YES. Maximal size of possible extension queue 2008. Compared 970540 event pairs, 34570 based on Foata normal form. 3511/126181 useless extension candidates. Maximal degree in co-relation 541893. Up to 102986 conditions per place. [2023-08-25 07:12:20,968 INFO L140 encePairwiseOnDemand]: 1004/1018 looper letters, 384 selfloop transitions, 123 changer transitions 0/524 dead transitions. [2023-08-25 07:12:20,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 524 transitions, 6871 flow [2023-08-25 07:12:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:12:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:12:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2356 transitions. [2023-08-25 07:12:20,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3857236411263916 [2023-08-25 07:12:20,971 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2356 transitions. [2023-08-25 07:12:20,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2356 transitions. [2023-08-25 07:12:20,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:20,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2356 transitions. [2023-08-25 07:12:20,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 392.6666666666667) internal successors, (2356), 6 states have internal predecessors, (2356), 0 states have call successors, (0), 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-25 07:12:20,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:12:20,977 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:12:20,977 INFO L175 Difference]: Start difference. First operand has 163 places, 316 transitions, 3615 flow. Second operand 6 states and 2356 transitions. [2023-08-25 07:12:20,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 524 transitions, 6871 flow [2023-08-25 07:12:33,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 524 transitions, 6397 flow, removed 228 selfloop flow, removed 4 redundant places. [2023-08-25 07:12:33,261 INFO L231 Difference]: Finished difference. Result has 169 places, 428 transitions, 5557 flow [2023-08-25 07:12:33,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=3429, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5557, PETRI_PLACES=169, PETRI_TRANSITIONS=428} [2023-08-25 07:12:33,262 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 27 predicate places. [2023-08-25 07:12:33,262 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 428 transitions, 5557 flow [2023-08-25 07:12:33,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 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-25 07:12:33,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:12:33,263 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:12:33,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 07:12:33,263 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:12:33,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:12:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash 448558508, now seen corresponding path program 3 times [2023-08-25 07:12:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:12:33,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455568846] [2023-08-25 07:12:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:12:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:12:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:12:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:12:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:12:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455568846] [2023-08-25 07:12:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455568846] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:12:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794105843] [2023-08-25 07:12:33,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 07:12:33,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:12:33,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:12:33,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:12:33,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 07:12:33,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 07:12:33,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:12:33,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-25 07:12:33,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:12:33,759 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 07:12:33,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 07:12:33,791 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 07:12:33,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 07:12:33,830 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-25 07:12:33,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 07:12:33,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-25 07:12:33,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-08-25 07:12:33,978 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:12:33,978 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 07:12:34,015 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:12:34,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 07:12:34,090 INFO L322 Elim1Store]: treesize reduction 83, result has 36.6 percent of original size [2023-08-25 07:12:34,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2023-08-25 07:12:34,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2023-08-25 07:12:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-25 07:12:34,163 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 07:12:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794105843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:12:34,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 07:12:34,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 16 [2023-08-25 07:12:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331484213] [2023-08-25 07:12:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:12:34,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 07:12:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:12:34,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 07:12:34,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-08-25 07:12:34,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 1018 [2023-08-25 07:12:34,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 428 transitions, 5557 flow. Second operand has 11 states, 11 states have (on average 337.90909090909093) internal successors, (3717), 11 states have internal predecessors, (3717), 0 states have call successors, (0), 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-25 07:12:34,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:12:34,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 1018 [2023-08-25 07:12:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:12:54,489 INFO L124 PetriNetUnfolderBase]: 100106/139746 cut-off events. [2023-08-25 07:12:54,489 INFO L125 PetriNetUnfolderBase]: For 767235/772612 co-relation queries the response was YES. [2023-08-25 07:12:55,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543077 conditions, 139746 events. 100106/139746 cut-off events. For 767235/772612 co-relation queries the response was YES. Maximal size of possible extension queue 1982. Compared 954572 event pairs, 16754 based on Foata normal form. 3367/124910 useless extension candidates. Maximal degree in co-relation 543037. Up to 91561 conditions per place. [2023-08-25 07:12:56,535 INFO L140 encePairwiseOnDemand]: 1007/1018 looper letters, 505 selfloop transitions, 36 changer transitions 0/558 dead transitions. [2023-08-25 07:12:56,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 558 transitions, 7712 flow [2023-08-25 07:12:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 07:12:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 07:12:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3504 transitions. [2023-08-25 07:12:56,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34420432220039293 [2023-08-25 07:12:56,541 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3504 transitions. [2023-08-25 07:12:56,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3504 transitions. [2023-08-25 07:12:56,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:12:56,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3504 transitions. [2023-08-25 07:12:56,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 350.4) internal successors, (3504), 10 states have internal predecessors, (3504), 0 states have call successors, (0), 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-25 07:12:56,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 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-25 07:12:56,550 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 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-25 07:12:56,550 INFO L175 Difference]: Start difference. First operand has 169 places, 428 transitions, 5557 flow. Second operand 10 states and 3504 transitions. [2023-08-25 07:12:56,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 558 transitions, 7712 flow [2023-08-25 07:13:13,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 558 transitions, 7484 flow, removed 48 selfloop flow, removed 1 redundant places. [2023-08-25 07:13:13,913 INFO L231 Difference]: Finished difference. Result has 176 places, 427 transitions, 5393 flow [2023-08-25 07:13:13,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=5321, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5393, PETRI_PLACES=176, PETRI_TRANSITIONS=427} [2023-08-25 07:13:13,913 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 34 predicate places. [2023-08-25 07:13:13,913 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 427 transitions, 5393 flow [2023-08-25 07:13:13,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 337.90909090909093) internal successors, (3717), 11 states have internal predecessors, (3717), 0 states have call successors, (0), 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-25 07:13:13,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:13,914 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:13,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 07:13:14,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:13:14,119 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:13:14,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 317234051, now seen corresponding path program 1 times [2023-08-25 07:13:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909407531] [2023-08-25 07:13:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:13:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909407531] [2023-08-25 07:13:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909407531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:13:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178059205] [2023-08-25 07:13:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:13:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:13:14,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 07:13:14,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 07:13:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:14,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 07:13:14,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:13:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:13:14,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:13:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 07:13:14,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178059205] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 07:13:14,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 07:13:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-08-25 07:13:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890474206] [2023-08-25 07:13:14,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:13:14,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:13:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:13:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:13:14,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-25 07:13:14,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 07:13:14,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 427 transitions, 5393 flow. Second operand has 6 states, 6 states have (on average 369.1666666666667) internal successors, (2215), 6 states have internal predecessors, (2215), 0 states have call successors, (0), 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-25 07:13:14,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:13:14,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 07:13:14,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:13:27,051 INFO L124 PetriNetUnfolderBase]: 53114/79180 cut-off events. [2023-08-25 07:13:27,052 INFO L125 PetriNetUnfolderBase]: For 667262/687266 co-relation queries the response was YES. [2023-08-25 07:13:27,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339376 conditions, 79180 events. 53114/79180 cut-off events. For 667262/687266 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 576631 event pairs, 13653 based on Foata normal form. 2295/70461 useless extension candidates. Maximal degree in co-relation 339336. Up to 63922 conditions per place. [2023-08-25 07:13:28,254 INFO L140 encePairwiseOnDemand]: 1006/1018 looper letters, 386 selfloop transitions, 29 changer transitions 14/470 dead transitions. [2023-08-25 07:13:28,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 470 transitions, 6552 flow [2023-08-25 07:13:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 07:13:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 07:13:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2298 transitions. [2023-08-25 07:13:28,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3762278978388998 [2023-08-25 07:13:28,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2298 transitions. [2023-08-25 07:13:28,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2298 transitions. [2023-08-25 07:13:28,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:13:28,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2298 transitions. [2023-08-25 07:13:28,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 383.0) internal successors, (2298), 6 states have internal predecessors, (2298), 0 states have call successors, (0), 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-25 07:13:28,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:13:28,261 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 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-25 07:13:28,261 INFO L175 Difference]: Start difference. First operand has 176 places, 427 transitions, 5393 flow. Second operand 6 states and 2298 transitions. [2023-08-25 07:13:28,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 470 transitions, 6552 flow [2023-08-25 07:13:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 470 transitions, 6478 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-08-25 07:13:30,355 INFO L231 Difference]: Finished difference. Result has 174 places, 417 transitions, 5344 flow [2023-08-25 07:13:30,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=5277, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5344, PETRI_PLACES=174, PETRI_TRANSITIONS=417} [2023-08-25 07:13:30,356 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 32 predicate places. [2023-08-25 07:13:30,356 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 417 transitions, 5344 flow [2023-08-25 07:13:30,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.1666666666667) internal successors, (2215), 6 states have internal predecessors, (2215), 0 states have call successors, (0), 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-25 07:13:30,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:13:30,356 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:13:30,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 07:13:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-25 07:13:30,563 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:13:30,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:13:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 935439775, now seen corresponding path program 1 times [2023-08-25 07:13:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:13:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868898926] [2023-08-25 07:13:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:13:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:13:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:13:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:13:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:13:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868898926] [2023-08-25 07:13:31,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868898926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:13:31,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:13:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:13:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123739708] [2023-08-25 07:13:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:13:31,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:13:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:13:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:13:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:13:31,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 1018 [2023-08-25 07:13:31,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 417 transitions, 5344 flow. Second operand has 8 states, 8 states have (on average 337.5) internal successors, (2700), 8 states have internal predecessors, (2700), 0 states have call successors, (0), 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-25 07:13:31,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:13:31,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 1018 [2023-08-25 07:13:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:13:55,173 INFO L124 PetriNetUnfolderBase]: 117285/164024 cut-off events. [2023-08-25 07:13:55,173 INFO L125 PetriNetUnfolderBase]: For 826142/830146 co-relation queries the response was YES. [2023-08-25 07:13:56,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633110 conditions, 164024 events. 117285/164024 cut-off events. For 826142/830146 co-relation queries the response was YES. Maximal size of possible extension queue 2901. Compared 1145555 event pairs, 33819 based on Foata normal form. 504/143753 useless extension candidates. Maximal degree in co-relation 633068. Up to 72218 conditions per place. [2023-08-25 07:13:57,432 INFO L140 encePairwiseOnDemand]: 1004/1018 looper letters, 635 selfloop transitions, 93 changer transitions 0/739 dead transitions. [2023-08-25 07:13:57,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 739 transitions, 10182 flow [2023-08-25 07:13:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:13:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:13:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3234 transitions. [2023-08-25 07:13:57,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3529796987557302 [2023-08-25 07:13:57,436 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3234 transitions. [2023-08-25 07:13:57,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3234 transitions. [2023-08-25 07:13:57,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:13:57,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3234 transitions. [2023-08-25 07:13:57,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 359.3333333333333) internal successors, (3234), 9 states have internal predecessors, (3234), 0 states have call successors, (0), 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-25 07:13:57,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:13:57,443 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:13:57,443 INFO L175 Difference]: Start difference. First operand has 174 places, 417 transitions, 5344 flow. Second operand 9 states and 3234 transitions. [2023-08-25 07:13:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 739 transitions, 10182 flow [2023-08-25 07:14:03,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 739 transitions, 10106 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-25 07:14:03,396 INFO L231 Difference]: Finished difference. Result has 179 places, 430 transitions, 5788 flow [2023-08-25 07:14:03,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=5274, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5788, PETRI_PLACES=179, PETRI_TRANSITIONS=430} [2023-08-25 07:14:03,396 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 37 predicate places. [2023-08-25 07:14:03,396 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 430 transitions, 5788 flow [2023-08-25 07:14:03,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 337.5) internal successors, (2700), 8 states have internal predecessors, (2700), 0 states have call successors, (0), 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-25 07:14:03,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:14:03,397 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:14:03,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-25 07:14:03,397 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:14:03,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:14:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1007339499, now seen corresponding path program 2 times [2023-08-25 07:14:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:14:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132100667] [2023-08-25 07:14:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:14:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:14:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:14:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 07:14:04,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:14:04,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132100667] [2023-08-25 07:14:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132100667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:14:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:14:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 07:14:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212193530] [2023-08-25 07:14:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:14:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 07:14:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:14:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 07:14:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 07:14:04,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 1018 [2023-08-25 07:14:04,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 430 transitions, 5788 flow. Second operand has 8 states, 8 states have (on average 337.5) internal successors, (2700), 8 states have internal predecessors, (2700), 0 states have call successors, (0), 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-25 07:14:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:14:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 1018 [2023-08-25 07:14:04,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:14:34,067 INFO L124 PetriNetUnfolderBase]: 139041/195013 cut-off events. [2023-08-25 07:14:34,067 INFO L125 PetriNetUnfolderBase]: For 1009244/1013309 co-relation queries the response was YES. [2023-08-25 07:14:36,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760075 conditions, 195013 events. 139041/195013 cut-off events. For 1009244/1013309 co-relation queries the response was YES. Maximal size of possible extension queue 3947. Compared 1406071 event pairs, 49951 based on Foata normal form. 474/170581 useless extension candidates. Maximal degree in co-relation 760032. Up to 130163 conditions per place. [2023-08-25 07:14:37,206 INFO L140 encePairwiseOnDemand]: 1005/1018 looper letters, 453 selfloop transitions, 201 changer transitions 0/665 dead transitions. [2023-08-25 07:14:37,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 665 transitions, 9115 flow [2023-08-25 07:14:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 07:14:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 07:14:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3240 transitions. [2023-08-25 07:14:37,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35363457760314343 [2023-08-25 07:14:37,209 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3240 transitions. [2023-08-25 07:14:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3240 transitions. [2023-08-25 07:14:37,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:14:37,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3240 transitions. [2023-08-25 07:14:37,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 360.0) internal successors, (3240), 9 states have internal predecessors, (3240), 0 states have call successors, (0), 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-25 07:14:37,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:14:37,217 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 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-25 07:14:37,217 INFO L175 Difference]: Start difference. First operand has 179 places, 430 transitions, 5788 flow. Second operand 9 states and 3240 transitions. [2023-08-25 07:14:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 665 transitions, 9115 flow [2023-08-25 07:14:49,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 665 transitions, 9075 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 07:14:49,535 INFO L231 Difference]: Finished difference. Result has 185 places, 443 transitions, 6495 flow [2023-08-25 07:14:49,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=5754, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6495, PETRI_PLACES=185, PETRI_TRANSITIONS=443} [2023-08-25 07:14:49,536 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 43 predicate places. [2023-08-25 07:14:49,536 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 443 transitions, 6495 flow [2023-08-25 07:14:49,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 337.5) internal successors, (2700), 8 states have internal predecessors, (2700), 0 states have call successors, (0), 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-25 07:14:49,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:14:49,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:14:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 07:14:49,537 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 07:14:49,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:14:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1345842560, now seen corresponding path program 1 times [2023-08-25 07:14:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:14:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661991788] [2023-08-25 07:14:49,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:14:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:14:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:14:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 07:14:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:14:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661991788] [2023-08-25 07:14:49,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661991788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:14:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:14:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 07:14:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149789670] [2023-08-25 07:14:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:14:49,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 07:14:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:14:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 07:14:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 07:14:49,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-25 07:14:49,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 443 transitions, 6495 flow. Second operand has 6 states, 6 states have (on average 379.5) internal successors, (2277), 6 states have internal predecessors, (2277), 0 states have call successors, (0), 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-25 07:14:49,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:14:49,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-25 07:14:49,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand