./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:53:06,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:53:06,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:53:06,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:53:06,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:53:06,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:53:06,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:53:06,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:53:06,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:53:06,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:53:06,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:53:06,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:53:06,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:53:06,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:53:06,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:53:06,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:53:06,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:53:06,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:53:06,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:53:06,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:53:06,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:53:06,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:53:06,135 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:53:06,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:53:06,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:53:06,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:53:06,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:53:06,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:53:06,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:53:06,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:53:06,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:53:06,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:06,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:53:06,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:53:06,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:53:06,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:53:06,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:53:06,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:53:06,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:53:06,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:53:06,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:53:06,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2024-10-13 09:53:06,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:53:06,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:53:06,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:53:06,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:53:06,449 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:53:06,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-10-13 09:53:07,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:53:08,176 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:53:08,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-10-13 09:53:08,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37245946/db312db5f4c84c508a4180663c7d9506/FLAG0b03ca035 [2024-10-13 09:53:08,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37245946/db312db5f4c84c508a4180663c7d9506 [2024-10-13 09:53:08,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:53:08,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:53:08,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:08,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:53:08,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:53:08,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bce5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08, skipping insertion in model container [2024-10-13 09:53:08,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:53:08,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:08,709 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:53:08,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:53:08,820 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:53:08,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08 WrapperNode [2024-10-13 09:53:08,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:53:08,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:08,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:53:08,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:53:08,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,891 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-10-13 09:53:08,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:53:08,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:53:08,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:53:08,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:53:08,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:53:08,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:53:08,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:53:08,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:53:08,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (1/1) ... [2024-10-13 09:53:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:53:08,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:08,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:53:08,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:53:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:53:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:53:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 09:53:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:53:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:53:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 09:53:09,043 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 09:53:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:53:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:53:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 09:53:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:53:09,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:53:09,046 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:53:09,193 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:53:09,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:53:09,559 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:53:09,559 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:53:09,601 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:53:09,602 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-13 09:53:09,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:09 BoogieIcfgContainer [2024-10-13 09:53:09,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:53:09,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:53:09,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:53:09,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:53:09,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:53:08" (1/3) ... [2024-10-13 09:53:09,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4060079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:09, skipping insertion in model container [2024-10-13 09:53:09,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:53:08" (2/3) ... [2024-10-13 09:53:09,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4060079e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:53:09, skipping insertion in model container [2024-10-13 09:53:09,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:53:09" (3/3) ... [2024-10-13 09:53:09,618 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2024-10-13 09:53:09,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:53:09,640 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 09:53:09,640 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:53:09,714 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 09:53:09,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 171 transitions, 349 flow [2024-10-13 09:53:09,857 INFO L124 PetriNetUnfolderBase]: 19/235 cut-off events. [2024-10-13 09:53:09,857 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:53:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 235 events. 19/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 713 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2024-10-13 09:53:09,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 171 transitions, 349 flow [2024-10-13 09:53:09,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 171 transitions, 349 flow [2024-10-13 09:53:09,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:09,900 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c296f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:09,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-13 09:53:09,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:09,919 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-10-13 09:53:09,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:09,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:09,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:09,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:09,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 467652431, now seen corresponding path program 1 times [2024-10-13 09:53:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:09,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587386785] [2024-10-13 09:53:09,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587386785] [2024-10-13 09:53:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587386785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:10,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409015387] [2024-10-13 09:53:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:11,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2024-10-13 09:53:11,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 171 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:11,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:11,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2024-10-13 09:53:11,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:12,050 INFO L124 PetriNetUnfolderBase]: 579/2152 cut-off events. [2024-10-13 09:53:12,051 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:53:12,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3410 conditions, 2152 events. 579/2152 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 15013 event pairs, 372 based on Foata normal form. 224/2225 useless extension candidates. Maximal degree in co-relation 3262. Up to 1080 conditions per place. [2024-10-13 09:53:12,073 INFO L140 encePairwiseOnDemand]: 136/171 looper letters, 73 selfloop transitions, 70 changer transitions 0/250 dead transitions. [2024-10-13 09:53:12,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 250 transitions, 793 flow [2024-10-13 09:53:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2024-10-13 09:53:12,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2024-10-13 09:53:12,101 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 349 flow. Second operand 6 states and 828 transitions. [2024-10-13 09:53:12,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 250 transitions, 793 flow [2024-10-13 09:53:12,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 250 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:12,115 INFO L231 Difference]: Finished difference. Result has 169 places, 226 transitions, 783 flow [2024-10-13 09:53:12,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=169, PETRI_TRANSITIONS=226} [2024-10-13 09:53:12,126 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 8 predicate places. [2024-10-13 09:53:12,126 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 783 flow [2024-10-13 09:53:12,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:12,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:12,127 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:12,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:53:12,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1570351445, now seen corresponding path program 1 times [2024-10-13 09:53:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156301063] [2024-10-13 09:53:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156301063] [2024-10-13 09:53:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156301063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837601993] [2024-10-13 09:53:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:12,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:12,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:12,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2024-10-13 09:53:12,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 226 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:12,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:12,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2024-10-13 09:53:12,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:12,407 INFO L124 PetriNetUnfolderBase]: 188/1063 cut-off events. [2024-10-13 09:53:12,408 INFO L125 PetriNetUnfolderBase]: For 119/133 co-relation queries the response was YES. [2024-10-13 09:53:12,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 1063 events. 188/1063 cut-off events. For 119/133 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6099 event pairs, 28 based on Foata normal form. 1/992 useless extension candidates. Maximal degree in co-relation 1641. Up to 191 conditions per place. [2024-10-13 09:53:12,417 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 22 selfloop transitions, 3 changer transitions 0/232 dead transitions. [2024-10-13 09:53:12,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 232 transitions, 845 flow [2024-10-13 09:53:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2024-10-13 09:53:12,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2024-10-13 09:53:12,419 INFO L175 Difference]: Start difference. First operand has 169 places, 226 transitions, 783 flow. Second operand 3 states and 445 transitions. [2024-10-13 09:53:12,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 232 transitions, 845 flow [2024-10-13 09:53:12,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 232 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:12,433 INFO L231 Difference]: Finished difference. Result has 172 places, 226 transitions, 794 flow [2024-10-13 09:53:12,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=172, PETRI_TRANSITIONS=226} [2024-10-13 09:53:12,437 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 11 predicate places. [2024-10-13 09:53:12,437 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 226 transitions, 794 flow [2024-10-13 09:53:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:12,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:12,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:53:12,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1630556509, now seen corresponding path program 1 times [2024-10-13 09:53:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:12,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897492398] [2024-10-13 09:53:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897492398] [2024-10-13 09:53:12,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897492398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:12,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:12,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575978567] [2024-10-13 09:53:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:12,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:12,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:13,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 171 [2024-10-13 09:53:13,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 226 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:13,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:13,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 171 [2024-10-13 09:53:13,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:13,494 INFO L124 PetriNetUnfolderBase]: 370/1574 cut-off events. [2024-10-13 09:53:13,496 INFO L125 PetriNetUnfolderBase]: For 473/492 co-relation queries the response was YES. [2024-10-13 09:53:13,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1574 events. 370/1574 cut-off events. For 473/492 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10718 event pairs, 96 based on Foata normal form. 2/1519 useless extension candidates. Maximal degree in co-relation 3131. Up to 642 conditions per place. [2024-10-13 09:53:13,508 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 112 selfloop transitions, 53 changer transitions 0/285 dead transitions. [2024-10-13 09:53:13,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 285 transitions, 1366 flow [2024-10-13 09:53:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2024-10-13 09:53:13,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.776803118908382 [2024-10-13 09:53:13,512 INFO L175 Difference]: Start difference. First operand has 172 places, 226 transitions, 794 flow. Second operand 6 states and 797 transitions. [2024-10-13 09:53:13,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 285 transitions, 1366 flow [2024-10-13 09:53:13,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 285 transitions, 1360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:53:13,523 INFO L231 Difference]: Finished difference. Result has 180 places, 269 transitions, 1276 flow [2024-10-13 09:53:13,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1276, PETRI_PLACES=180, PETRI_TRANSITIONS=269} [2024-10-13 09:53:13,526 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 19 predicate places. [2024-10-13 09:53:13,526 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 269 transitions, 1276 flow [2024-10-13 09:53:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:13,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:13,529 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:53:13,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-13 09:53:13,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 794013781, now seen corresponding path program 1 times [2024-10-13 09:53:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447761274] [2024-10-13 09:53:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:13,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:53:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:53:13,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:53:13,617 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:53:13,618 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-13 09:53:13,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-13 09:53:13,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-13 09:53:13,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-13 09:53:13,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-13 09:53:13,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-13 09:53:13,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-13 09:53:13,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:53:13,623 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 09:53:13,626 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:53:13,626 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 09:53:13,678 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:53:13,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 237 transitions, 490 flow [2024-10-13 09:53:13,727 INFO L124 PetriNetUnfolderBase]: 34/393 cut-off events. [2024-10-13 09:53:13,727 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:53:13,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 393 events. 34/393 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1497 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 237. Up to 8 conditions per place. [2024-10-13 09:53:13,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 237 transitions, 490 flow [2024-10-13 09:53:13,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 237 transitions, 490 flow [2024-10-13 09:53:13,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:53:13,737 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c296f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:53:13,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 09:53:13,741 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:53:13,741 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-10-13 09:53:13,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:53:13,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:13,742 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:13,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:13,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash -83295473, now seen corresponding path program 1 times [2024-10-13 09:53:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800123248] [2024-10-13 09:53:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800123248] [2024-10-13 09:53:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800123248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073141473] [2024-10-13 09:53:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:14,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:14,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 237 [2024-10-13 09:53:14,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 237 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:14,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:14,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 237 [2024-10-13 09:53:14,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:23,169 INFO L124 PetriNetUnfolderBase]: 29151/68521 cut-off events. [2024-10-13 09:53:23,169 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2024-10-13 09:53:23,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114057 conditions, 68521 events. 29151/68521 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 763548 event pairs, 20503 based on Foata normal form. 8143/72555 useless extension candidates. Maximal degree in co-relation 101006. Up to 40549 conditions per place. [2024-10-13 09:53:23,583 INFO L140 encePairwiseOnDemand]: 180/237 looper letters, 122 selfloop transitions, 134 changer transitions 0/399 dead transitions. [2024-10-13 09:53:23,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 399 transitions, 1331 flow [2024-10-13 09:53:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2024-10-13 09:53:23,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8347398030942335 [2024-10-13 09:53:23,589 INFO L175 Difference]: Start difference. First operand has 222 places, 237 transitions, 490 flow. Second operand 6 states and 1187 transitions. [2024-10-13 09:53:23,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 399 transitions, 1331 flow [2024-10-13 09:53:23,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 399 transitions, 1331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:23,604 INFO L231 Difference]: Finished difference. Result has 230 places, 350 transitions, 1328 flow [2024-10-13 09:53:23,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1328, PETRI_PLACES=230, PETRI_TRANSITIONS=350} [2024-10-13 09:53:23,607 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 8 predicate places. [2024-10-13 09:53:23,608 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 350 transitions, 1328 flow [2024-10-13 09:53:23,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:23,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:23,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:23,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:53:23,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1544665099, now seen corresponding path program 1 times [2024-10-13 09:53:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:23,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645874570] [2024-10-13 09:53:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645874570] [2024-10-13 09:53:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645874570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:53:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195086986] [2024-10-13 09:53:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:23,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:53:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:53:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:53:23,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 237 [2024-10-13 09:53:23,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 350 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:23,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:23,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 237 [2024-10-13 09:53:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:27,555 INFO L124 PetriNetUnfolderBase]: 9834/30958 cut-off events. [2024-10-13 09:53:27,556 INFO L125 PetriNetUnfolderBase]: For 5174/5550 co-relation queries the response was YES. [2024-10-13 09:53:27,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55394 conditions, 30958 events. 9834/30958 cut-off events. For 5174/5550 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 350060 event pairs, 3863 based on Foata normal form. 1/28435 useless extension candidates. Maximal degree in co-relation 49398. Up to 9284 conditions per place. [2024-10-13 09:53:27,812 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 32 selfloop transitions, 3 changer transitions 0/358 dead transitions. [2024-10-13 09:53:27,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 358 transitions, 1420 flow [2024-10-13 09:53:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:53:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:53:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-10-13 09:53:27,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8579465541490858 [2024-10-13 09:53:27,815 INFO L175 Difference]: Start difference. First operand has 230 places, 350 transitions, 1328 flow. Second operand 3 states and 610 transitions. [2024-10-13 09:53:27,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 358 transitions, 1420 flow [2024-10-13 09:53:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 358 transitions, 1420 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:27,976 INFO L231 Difference]: Finished difference. Result has 233 places, 352 transitions, 1353 flow [2024-10-13 09:53:27,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=233, PETRI_TRANSITIONS=352} [2024-10-13 09:53:27,981 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 11 predicate places. [2024-10-13 09:53:27,981 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 352 transitions, 1353 flow [2024-10-13 09:53:27,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:27,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:27,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:27,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:53:27,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1452137411, now seen corresponding path program 1 times [2024-10-13 09:53:27,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161151852] [2024-10-13 09:53:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161151852] [2024-10-13 09:53:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161151852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641868127] [2024-10-13 09:53:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:28,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2024-10-13 09:53:28,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 352 transitions, 1353 flow. Second operand has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:28,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:28,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2024-10-13 09:53:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:34,886 INFO L124 PetriNetUnfolderBase]: 21468/52051 cut-off events. [2024-10-13 09:53:34,886 INFO L125 PetriNetUnfolderBase]: For 19115/20486 co-relation queries the response was YES. [2024-10-13 09:53:35,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116664 conditions, 52051 events. 21468/52051 cut-off events. For 19115/20486 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 574105 event pairs, 8210 based on Foata normal form. 38/49382 useless extension candidates. Maximal degree in co-relation 116492. Up to 25409 conditions per place. [2024-10-13 09:53:35,323 INFO L140 encePairwiseOnDemand]: 211/237 looper letters, 192 selfloop transitions, 141 changer transitions 0/531 dead transitions. [2024-10-13 09:53:35,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 531 transitions, 2821 flow [2024-10-13 09:53:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1141 transitions. [2024-10-13 09:53:35,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8023909985935302 [2024-10-13 09:53:35,327 INFO L175 Difference]: Start difference. First operand has 233 places, 352 transitions, 1353 flow. Second operand 6 states and 1141 transitions. [2024-10-13 09:53:35,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 531 transitions, 2821 flow [2024-10-13 09:53:35,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 531 transitions, 2818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:53:35,629 INFO L231 Difference]: Finished difference. Result has 242 places, 483 transitions, 2734 flow [2024-10-13 09:53:35,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2734, PETRI_PLACES=242, PETRI_TRANSITIONS=483} [2024-10-13 09:53:35,630 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 20 predicate places. [2024-10-13 09:53:35,631 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 483 transitions, 2734 flow [2024-10-13 09:53:35,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:35,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:35,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:35,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:53:35,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:35,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash -109579940, now seen corresponding path program 1 times [2024-10-13 09:53:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401649555] [2024-10-13 09:53:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:35,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:35,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401649555] [2024-10-13 09:53:35,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401649555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:53:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977855950] [2024-10-13 09:53:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:35,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:35,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:35,719 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) [2024-10-13 09:53:35,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:53:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:35,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 09:53:35,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:53:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:35,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:53:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977855950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:53:35,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:53:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 09:53:35,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304813421] [2024-10-13 09:53:35,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:53:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:53:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:53:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:53:36,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 237 [2024-10-13 09:53:36,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 483 transitions, 2734 flow. Second operand has 10 states, 10 states have (on average 191.3) internal successors, (1913), 10 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:36,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:36,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 237 [2024-10-13 09:53:36,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:40,333 INFO L124 PetriNetUnfolderBase]: 12751/34552 cut-off events. [2024-10-13 09:53:40,333 INFO L125 PetriNetUnfolderBase]: For 23626/25136 co-relation queries the response was YES. [2024-10-13 09:53:40,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85420 conditions, 34552 events. 12751/34552 cut-off events. For 23626/25136 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 364597 event pairs, 2011 based on Foata normal form. 197/33131 useless extension candidates. Maximal degree in co-relation 35054. Up to 13493 conditions per place. [2024-10-13 09:53:40,600 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 72 selfloop transitions, 9 changer transitions 0/491 dead transitions. [2024-10-13 09:53:40,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 491 transitions, 2904 flow [2024-10-13 09:53:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:53:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 09:53:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2024-10-13 09:53:40,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8354430379746836 [2024-10-13 09:53:40,605 INFO L175 Difference]: Start difference. First operand has 242 places, 483 transitions, 2734 flow. Second operand 9 states and 1782 transitions. [2024-10-13 09:53:40,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 491 transitions, 2904 flow [2024-10-13 09:53:40,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 491 transitions, 2886 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-13 09:53:40,868 INFO L231 Difference]: Finished difference. Result has 202 places, 435 transitions, 2630 flow [2024-10-13 09:53:40,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=2608, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2630, PETRI_PLACES=202, PETRI_TRANSITIONS=435} [2024-10-13 09:53:40,869 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -20 predicate places. [2024-10-13 09:53:40,869 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 435 transitions, 2630 flow [2024-10-13 09:53:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 191.3) internal successors, (1913), 10 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:40,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:40,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:40,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:53:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:41,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -369686586, now seen corresponding path program 1 times [2024-10-13 09:53:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288778107] [2024-10-13 09:53:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:53:41,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:41,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288778107] [2024-10-13 09:53:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288778107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:53:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:53:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:53:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859804510] [2024-10-13 09:53:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:53:41,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:53:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:53:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:53:42,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 237 [2024-10-13 09:53:42,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 435 transitions, 2630 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:42,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:42,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 237 [2024-10-13 09:53:42,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:53:47,566 INFO L124 PetriNetUnfolderBase]: 19381/43330 cut-off events. [2024-10-13 09:53:47,566 INFO L125 PetriNetUnfolderBase]: For 43582/45766 co-relation queries the response was YES. [2024-10-13 09:53:47,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129445 conditions, 43330 events. 19381/43330 cut-off events. For 43582/45766 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 430540 event pairs, 5304 based on Foata normal form. 67/41642 useless extension candidates. Maximal degree in co-relation 112407. Up to 28116 conditions per place. [2024-10-13 09:53:48,147 INFO L140 encePairwiseOnDemand]: 210/237 looper letters, 338 selfloop transitions, 213 changer transitions 0/666 dead transitions. [2024-10-13 09:53:48,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 666 transitions, 5074 flow [2024-10-13 09:53:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:53:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:53:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1048 transitions. [2024-10-13 09:53:48,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7369901547116737 [2024-10-13 09:53:48,150 INFO L175 Difference]: Start difference. First operand has 202 places, 435 transitions, 2630 flow. Second operand 6 states and 1048 transitions. [2024-10-13 09:53:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 666 transitions, 5074 flow [2024-10-13 09:53:48,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 666 transitions, 5051 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-13 09:53:48,445 INFO L231 Difference]: Finished difference. Result has 207 places, 638 transitions, 4917 flow [2024-10-13 09:53:48,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4917, PETRI_PLACES=207, PETRI_TRANSITIONS=638} [2024-10-13 09:53:48,446 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -15 predicate places. [2024-10-13 09:53:48,446 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 638 transitions, 4917 flow [2024-10-13 09:53:48,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:48,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:53:48,448 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:53:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:53:48,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:53:48,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:53:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 34053723, now seen corresponding path program 1 times [2024-10-13 09:53:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:53:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391774358] [2024-10-13 09:53:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:53:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 09:53:49,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:53:49,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391774358] [2024-10-13 09:53:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391774358] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:53:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957802877] [2024-10-13 09:53:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:53:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:53:49,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:53:49,021 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) [2024-10-13 09:53:49,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:53:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:53:49,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 09:53:49,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:53:49,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 09:53:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 09:53:49,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-10-13 09:53:49,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2024-10-13 09:53:49,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 09:53:49,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2024-10-13 09:53:49,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 09:53:49,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 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 [2024-10-13 09:53:49,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-13 09:53:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 09:53:49,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:53:49,690 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))) is different from false [2024-10-13 09:53:49,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))))) is different from false [2024-10-13 09:53:49,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))))))) is different from false [2024-10-13 09:53:49,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 09:53:49,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-13 09:53:50,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 09:53:50,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-10-13 09:53:50,023 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 09:53:50,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-13 09:53:50,033 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 09:53:50,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-13 09:53:50,040 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-13 09:53:50,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-13 09:53:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-10-13 09:53:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957802877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:53:54,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:53:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-13 09:53:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850873601] [2024-10-13 09:53:54,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:53:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 09:53:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:53:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 09:53:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=229, Unknown=17, NotChecked=102, Total=420 [2024-10-13 09:53:54,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2024-10-13 09:53:54,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 638 transitions, 4917 flow. Second operand has 21 states, 21 states have (on average 105.19047619047619) internal successors, (2209), 21 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:53:54,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:53:54,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2024-10-13 09:53:54,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand