./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 61a67961 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-wip.fs.cvc5-61a6796-m [2024-10-14 17:07:56,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:07:56,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:07:56,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:07:56,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:07:56,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:07:56,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:07:56,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:07:56,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:07:56,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:07:56,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:07:56,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:07:56,995 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:07:56,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:07:56,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:07:56,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:07:56,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:07:56,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:07:57,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:07:57,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:07:57,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:07:57,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:07:57,001 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:07:57,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:07:57,002 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:07:57,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:07:57,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:07:57,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:07:57,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:07:57,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:07:57,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:07:57,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:07:57,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:07:57,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:07:57,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:07:57,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:07:57,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:07:57,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:07:57,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:07:57,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:07:57,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:07:57,007 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-14 17:07:57,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:07:57,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:07:57,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:07:57,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:07:57,316 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:07:57,318 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-14 17:07:58,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:07:59,142 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:07:59,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2024-10-14 17:07:59,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df008eca6/b24c0ae0d37f4a5bb8cdb4b8c46fe988/FLAG1c9c98afc [2024-10-14 17:07:59,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df008eca6/b24c0ae0d37f4a5bb8cdb4b8c46fe988 [2024-10-14 17:07:59,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:07:59,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:07:59,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:07:59,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:07:59,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:07:59,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:59" (1/1) ... [2024-10-14 17:07:59,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c7b0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:59, skipping insertion in model container [2024-10-14 17:07:59,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:59" (1/1) ... [2024-10-14 17:07:59,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:07:59,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:07:59,896 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:07:59,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:08:00,007 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:08:00,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00 WrapperNode [2024-10-14 17:08:00,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:08:00,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:08:00,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:08:00,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:08:00,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,067 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-10-14 17:08:00,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:08:00,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:08:00,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:08:00,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:08:00,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:08:00,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:08:00,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:08:00,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:08:00,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (1/1) ... [2024-10-14 17:08:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:08:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:00,180 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-14 17:08:00,184 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-14 17:08:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:08:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:08:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 17:08:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:08:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:08:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 17:08:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 17:08:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:08:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:08:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 17:08:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:08:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:08:00,243 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:08:00,424 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:08:00,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:08:00,842 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:08:00,843 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:08:00,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:08:00,881 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 17:08:00,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:00 BoogieIcfgContainer [2024-10-14 17:08:00,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:08:00,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:08:00,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:08:00,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:08:00,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:07:59" (1/3) ... [2024-10-14 17:08:00,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea32c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:00, skipping insertion in model container [2024-10-14 17:08:00,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00" (2/3) ... [2024-10-14 17:08:00,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea32c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:00, skipping insertion in model container [2024-10-14 17:08:00,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:00" (3/3) ... [2024-10-14 17:08:00,892 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2024-10-14 17:08:00,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:08:00,918 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-14 17:08:00,918 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:08:01,019 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:08:01,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 171 transitions, 349 flow [2024-10-14 17:08:01,231 INFO L124 PetriNetUnfolderBase]: 19/235 cut-off events. [2024-10-14 17:08:01,232 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:08:01,241 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-14 17:08:01,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 171 transitions, 349 flow [2024-10-14 17:08:01,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 171 transitions, 349 flow [2024-10-14 17:08:01,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:08:01,276 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;@6f40ac0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:08:01,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-14 17:08:01,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:08:01,298 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-10-14 17:08:01,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:08:01,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:01,299 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-14 17:08:01,300 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-14 17:08:01,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash 467652431, now seen corresponding path program 1 times [2024-10-14 17:08:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344361358] [2024-10-14 17:08:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:02,371 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-14 17:08:02,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:02,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344361358] [2024-10-14 17:08:02,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344361358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:02,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:02,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162558910] [2024-10-14 17:08:02,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:02,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:02,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2024-10-14 17:08:02,853 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-14 17:08:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2024-10-14 17:08:02,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:03,504 INFO L124 PetriNetUnfolderBase]: 579/2152 cut-off events. [2024-10-14 17:08:03,505 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:08:03,516 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-14 17:08:03,530 INFO L140 encePairwiseOnDemand]: 136/171 looper letters, 73 selfloop transitions, 70 changer transitions 0/250 dead transitions. [2024-10-14 17:08:03,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 250 transitions, 793 flow [2024-10-14 17:08:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2024-10-14 17:08:03,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2024-10-14 17:08:03,558 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 349 flow. Second operand 6 states and 828 transitions. [2024-10-14 17:08:03,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 250 transitions, 793 flow [2024-10-14 17:08:03,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 250 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:03,572 INFO L231 Difference]: Finished difference. Result has 169 places, 226 transitions, 783 flow [2024-10-14 17:08:03,575 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-14 17:08:03,581 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 8 predicate places. [2024-10-14 17:08:03,581 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 783 flow [2024-10-14 17:08:03,582 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-14 17:08:03,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:03,583 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-14 17:08:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:08:03,584 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-14 17:08:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1570351445, now seen corresponding path program 1 times [2024-10-14 17:08:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079096067] [2024-10-14 17:08:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079096067] [2024-10-14 17:08:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079096067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:08:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099142264] [2024-10-14 17:08:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:03,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:03,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:03,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:03,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2024-10-14 17:08:03,693 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-14 17:08:03,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:03,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2024-10-14 17:08:03,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:03,886 INFO L124 PetriNetUnfolderBase]: 188/1063 cut-off events. [2024-10-14 17:08:03,886 INFO L125 PetriNetUnfolderBase]: For 119/133 co-relation queries the response was YES. [2024-10-14 17:08:03,890 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-14 17:08:03,893 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 22 selfloop transitions, 3 changer transitions 0/232 dead transitions. [2024-10-14 17:08:03,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 232 transitions, 845 flow [2024-10-14 17:08:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2024-10-14 17:08:03,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2024-10-14 17:08:03,896 INFO L175 Difference]: Start difference. First operand has 169 places, 226 transitions, 783 flow. Second operand 3 states and 445 transitions. [2024-10-14 17:08:03,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 232 transitions, 845 flow [2024-10-14 17:08:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 232 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:03,911 INFO L231 Difference]: Finished difference. Result has 172 places, 226 transitions, 794 flow [2024-10-14 17:08:03,913 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-14 17:08:03,914 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 11 predicate places. [2024-10-14 17:08:03,914 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 226 transitions, 794 flow [2024-10-14 17:08:03,915 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-14 17:08:03,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:03,915 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-14 17:08:03,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:08:03,916 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-14 17:08:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1630556509, now seen corresponding path program 1 times [2024-10-14 17:08:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323911416] [2024-10-14 17:08:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323911416] [2024-10-14 17:08:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323911416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642830958] [2024-10-14 17:08:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:04,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 171 [2024-10-14 17:08:04,556 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-14 17:08:04,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:04,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 171 [2024-10-14 17:08:04,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:04,920 INFO L124 PetriNetUnfolderBase]: 370/1574 cut-off events. [2024-10-14 17:08:04,921 INFO L125 PetriNetUnfolderBase]: For 473/492 co-relation queries the response was YES. [2024-10-14 17:08:04,925 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-14 17:08:04,935 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 112 selfloop transitions, 53 changer transitions 0/285 dead transitions. [2024-10-14 17:08:04,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 285 transitions, 1366 flow [2024-10-14 17:08:04,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2024-10-14 17:08:04,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.776803118908382 [2024-10-14 17:08:04,938 INFO L175 Difference]: Start difference. First operand has 172 places, 226 transitions, 794 flow. Second operand 6 states and 797 transitions. [2024-10-14 17:08:04,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 285 transitions, 1366 flow [2024-10-14 17:08:04,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 285 transitions, 1360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:08:04,951 INFO L231 Difference]: Finished difference. Result has 180 places, 269 transitions, 1276 flow [2024-10-14 17:08:04,951 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-14 17:08:04,952 INFO L277 CegarLoopForPetriNet]: 161 programPoint places, 19 predicate places. [2024-10-14 17:08:04,953 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 269 transitions, 1276 flow [2024-10-14 17:08:04,954 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-14 17:08:04,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:04,955 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-14 17:08:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:08:04,956 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-14 17:08:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 794013781, now seen corresponding path program 1 times [2024-10-14 17:08:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468663490] [2024-10-14 17:08:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:08:04,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:08:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:08:05,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:08:05,054 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:08:05,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-14 17:08:05,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-14 17:08:05,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-14 17:08:05,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-14 17:08:05,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-14 17:08:05,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-14 17:08:05,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-14 17:08:05,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-14 17:08:05,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-14 17:08:05,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-14 17:08:05,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-14 17:08:05,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-14 17:08:05,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:08:05,064 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 17:08:05,068 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:08:05,068 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 17:08:05,116 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:08:05,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 237 transitions, 490 flow [2024-10-14 17:08:05,178 INFO L124 PetriNetUnfolderBase]: 34/393 cut-off events. [2024-10-14 17:08:05,178 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:08:05,183 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-14 17:08:05,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 237 transitions, 490 flow [2024-10-14 17:08:05,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 237 transitions, 490 flow [2024-10-14 17:08:05,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:08:05,196 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;@6f40ac0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:08:05,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-14 17:08:05,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:08:05,203 INFO L124 PetriNetUnfolderBase]: 2/60 cut-off events. [2024-10-14 17:08:05,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:08:05,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:05,204 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:05,205 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-14 17:08:05,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash -83295473, now seen corresponding path program 1 times [2024-10-14 17:08:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820019977] [2024-10-14 17:08:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:05,534 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-14 17:08:05,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:05,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820019977] [2024-10-14 17:08:05,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820019977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:05,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163655382] [2024-10-14 17:08:05,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:05,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:05,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 237 [2024-10-14 17:08:05,827 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-14 17:08:05,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:05,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 237 [2024-10-14 17:08:05,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:14,526 INFO L124 PetriNetUnfolderBase]: 29151/68521 cut-off events. [2024-10-14 17:08:14,526 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2024-10-14 17:08:14,695 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-14 17:08:15,000 INFO L140 encePairwiseOnDemand]: 180/237 looper letters, 122 selfloop transitions, 134 changer transitions 0/399 dead transitions. [2024-10-14 17:08:15,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 399 transitions, 1331 flow [2024-10-14 17:08:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2024-10-14 17:08:15,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8347398030942335 [2024-10-14 17:08:15,006 INFO L175 Difference]: Start difference. First operand has 222 places, 237 transitions, 490 flow. Second operand 6 states and 1187 transitions. [2024-10-14 17:08:15,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 399 transitions, 1331 flow [2024-10-14 17:08:15,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 399 transitions, 1331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:15,025 INFO L231 Difference]: Finished difference. Result has 230 places, 350 transitions, 1328 flow [2024-10-14 17:08:15,026 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-14 17:08:15,028 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 8 predicate places. [2024-10-14 17:08:15,028 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 350 transitions, 1328 flow [2024-10-14 17:08:15,029 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-14 17:08:15,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:15,029 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-14 17:08:15,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:08:15,030 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-14 17:08:15,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1544665099, now seen corresponding path program 1 times [2024-10-14 17:08:15,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:15,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391139898] [2024-10-14 17:08:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:15,079 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-14 17:08:15,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391139898] [2024-10-14 17:08:15,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391139898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:15,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:08:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122527910] [2024-10-14 17:08:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:15,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 237 [2024-10-14 17:08:15,110 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-14 17:08:15,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:15,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 237 [2024-10-14 17:08:15,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:18,922 INFO L124 PetriNetUnfolderBase]: 9834/30958 cut-off events. [2024-10-14 17:08:18,922 INFO L125 PetriNetUnfolderBase]: For 5174/5550 co-relation queries the response was YES. [2024-10-14 17:08:19,036 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-14 17:08:19,188 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 32 selfloop transitions, 3 changer transitions 0/358 dead transitions. [2024-10-14 17:08:19,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 358 transitions, 1420 flow [2024-10-14 17:08:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 610 transitions. [2024-10-14 17:08:19,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8579465541490858 [2024-10-14 17:08:19,192 INFO L175 Difference]: Start difference. First operand has 230 places, 350 transitions, 1328 flow. Second operand 3 states and 610 transitions. [2024-10-14 17:08:19,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 358 transitions, 1420 flow [2024-10-14 17:08:19,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 358 transitions, 1420 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:19,396 INFO L231 Difference]: Finished difference. Result has 233 places, 352 transitions, 1353 flow [2024-10-14 17:08:19,396 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-14 17:08:19,397 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 11 predicate places. [2024-10-14 17:08:19,397 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 352 transitions, 1353 flow [2024-10-14 17:08:19,398 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-14 17:08:19,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:19,398 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-14 17:08:19,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:08:19,399 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-14 17:08:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1452137411, now seen corresponding path program 1 times [2024-10-14 17:08:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23114531] [2024-10-14 17:08:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:19,868 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-14 17:08:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23114531] [2024-10-14 17:08:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23114531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189260963] [2024-10-14 17:08:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:19,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:20,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2024-10-14 17:08:20,242 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-14 17:08:20,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:20,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2024-10-14 17:08:20,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:26,042 INFO L124 PetriNetUnfolderBase]: 21468/52051 cut-off events. [2024-10-14 17:08:26,043 INFO L125 PetriNetUnfolderBase]: For 19115/20486 co-relation queries the response was YES. [2024-10-14 17:08:26,248 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-14 17:08:26,508 INFO L140 encePairwiseOnDemand]: 211/237 looper letters, 192 selfloop transitions, 141 changer transitions 0/531 dead transitions. [2024-10-14 17:08:26,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 531 transitions, 2821 flow [2024-10-14 17:08:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1141 transitions. [2024-10-14 17:08:26,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8023909985935302 [2024-10-14 17:08:26,511 INFO L175 Difference]: Start difference. First operand has 233 places, 352 transitions, 1353 flow. Second operand 6 states and 1141 transitions. [2024-10-14 17:08:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 531 transitions, 2821 flow [2024-10-14 17:08:26,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 531 transitions, 2818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:08:26,909 INFO L231 Difference]: Finished difference. Result has 242 places, 483 transitions, 2734 flow [2024-10-14 17:08:26,910 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-14 17:08:26,911 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, 20 predicate places. [2024-10-14 17:08:26,911 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 483 transitions, 2734 flow [2024-10-14 17:08:26,912 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-14 17:08:26,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:26,912 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-14 17:08:26,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:08:26,912 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-14 17:08:26,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -109579940, now seen corresponding path program 1 times [2024-10-14 17:08:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811015776] [2024-10-14 17:08:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:27,010 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-14 17:08:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811015776] [2024-10-14 17:08:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811015776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:08:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388182952] [2024-10-14 17:08:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:27,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:27,016 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-14 17:08:27,018 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-14 17:08:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:27,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:08:27,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:08:27,217 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-14 17:08:27,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:08:27,281 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-14 17:08:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388182952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:08:27,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:08:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-14 17:08:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755192548] [2024-10-14 17:08:27,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:08:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:08:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:08:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:08:27,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 237 [2024-10-14 17:08:27,365 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-14 17:08:27,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:27,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 237 [2024-10-14 17:08:27,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:31,566 INFO L124 PetriNetUnfolderBase]: 12751/34552 cut-off events. [2024-10-14 17:08:31,566 INFO L125 PetriNetUnfolderBase]: For 23626/25136 co-relation queries the response was YES. [2024-10-14 17:08:31,695 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-14 17:08:32,035 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 72 selfloop transitions, 9 changer transitions 0/491 dead transitions. [2024-10-14 17:08:32,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 491 transitions, 2904 flow [2024-10-14 17:08:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:08:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 17:08:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2024-10-14 17:08:32,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8354430379746836 [2024-10-14 17:08:32,040 INFO L175 Difference]: Start difference. First operand has 242 places, 483 transitions, 2734 flow. Second operand 9 states and 1782 transitions. [2024-10-14 17:08:32,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 491 transitions, 2904 flow [2024-10-14 17:08:32,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 491 transitions, 2886 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:32,274 INFO L231 Difference]: Finished difference. Result has 202 places, 435 transitions, 2630 flow [2024-10-14 17:08:32,275 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-14 17:08:32,277 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -20 predicate places. [2024-10-14 17:08:32,277 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 435 transitions, 2630 flow [2024-10-14 17:08:32,279 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-14 17:08:32,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:32,279 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-14 17:08:32,302 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-14 17:08:32,484 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-14 17:08:32,484 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-14 17:08:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -369686586, now seen corresponding path program 1 times [2024-10-14 17:08:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:32,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788025585] [2024-10-14 17:08:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:32,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:32,906 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-14 17:08:32,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788025585] [2024-10-14 17:08:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788025585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752474410] [2024-10-14 17:08:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:32,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:33,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 237 [2024-10-14 17:08:33,229 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-14 17:08:33,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:33,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 237 [2024-10-14 17:08:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:38,908 INFO L124 PetriNetUnfolderBase]: 19381/43330 cut-off events. [2024-10-14 17:08:38,908 INFO L125 PetriNetUnfolderBase]: For 43582/45766 co-relation queries the response was YES. [2024-10-14 17:08:39,093 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-14 17:08:39,245 INFO L140 encePairwiseOnDemand]: 210/237 looper letters, 338 selfloop transitions, 213 changer transitions 0/666 dead transitions. [2024-10-14 17:08:39,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 666 transitions, 5074 flow [2024-10-14 17:08:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1048 transitions. [2024-10-14 17:08:39,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7369901547116737 [2024-10-14 17:08:39,249 INFO L175 Difference]: Start difference. First operand has 202 places, 435 transitions, 2630 flow. Second operand 6 states and 1048 transitions. [2024-10-14 17:08:39,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 666 transitions, 5074 flow [2024-10-14 17:08:39,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 666 transitions, 5051 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-14 17:08:39,534 INFO L231 Difference]: Finished difference. Result has 207 places, 638 transitions, 4917 flow [2024-10-14 17:08:39,535 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-14 17:08:39,535 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -15 predicate places. [2024-10-14 17:08:39,536 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 638 transitions, 4917 flow [2024-10-14 17:08:39,536 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-14 17:08:39,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:39,537 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-14 17:08:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:08:39,537 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-14 17:08:39,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash 34053723, now seen corresponding path program 1 times [2024-10-14 17:08:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969134059] [2024-10-14 17:08:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:40,084 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-14 17:08:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969134059] [2024-10-14 17:08:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969134059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:08:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040188213] [2024-10-14 17:08:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:40,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:40,088 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-14 17:08:40,089 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-14 17:08:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:40,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:08:40,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:08:40,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:08:40,311 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-14 17:08:40,442 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-14 17:08:40,456 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-14 17:08:40,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:08:40,484 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-14 17:08:40,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:08:40,515 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-14 17:08:40,705 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-14 17:08:40,746 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-14 17:08:40,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:08:40,793 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-14 17:08:40,917 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-14 17:08:40,947 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-14 17:08:41,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:08:41,126 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-14 17:08:41,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:08:41,140 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-14 17:08:41,152 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:08:41,152 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-14 17:08:41,159 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:08:41,159 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-14 17:08:41,167 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:08:41,168 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-14 17:08:45,339 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-14 17:08:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040188213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:08:45,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:08:45,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-14 17:08:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966952169] [2024-10-14 17:08:45,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:08:45,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 17:08:45,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:45,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 17:08:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=229, Unknown=17, NotChecked=102, Total=420 [2024-10-14 17:08:45,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2024-10-14 17:08:45,353 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-14 17:08:45,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:45,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2024-10-14 17:08:45,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:09:03,474 INFO L124 PetriNetUnfolderBase]: 56162/110833 cut-off events. [2024-10-14 17:09:03,475 INFO L125 PetriNetUnfolderBase]: For 148415/154460 co-relation queries the response was YES. [2024-10-14 17:09:04,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345393 conditions, 110833 events. 56162/110833 cut-off events. For 148415/154460 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 1115215 event pairs, 11945 based on Foata normal form. 2183/108048 useless extension candidates. Maximal degree in co-relation 302302. Up to 64432 conditions per place. [2024-10-14 17:09:04,565 INFO L140 encePairwiseOnDemand]: 194/237 looper letters, 428 selfloop transitions, 566 changer transitions 0/1072 dead transitions. [2024-10-14 17:09:04,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1072 transitions, 9752 flow [2024-10-14 17:09:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:09:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 17:09:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1449 transitions. [2024-10-14 17:09:04,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6113924050632912 [2024-10-14 17:09:04,570 INFO L175 Difference]: Start difference. First operand has 207 places, 638 transitions, 4917 flow. Second operand 10 states and 1449 transitions. [2024-10-14 17:09:04,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1072 transitions, 9752 flow [2024-10-14 17:09:05,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 1072 transitions, 9392 flow, removed 180 selfloop flow, removed 0 redundant places. [2024-10-14 17:09:06,006 INFO L231 Difference]: Finished difference. Result has 219 places, 883 transitions, 9170 flow [2024-10-14 17:09:06,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=4685, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9170, PETRI_PLACES=219, PETRI_TRANSITIONS=883} [2024-10-14 17:09:06,007 INFO L277 CegarLoopForPetriNet]: 222 programPoint places, -3 predicate places. [2024-10-14 17:09:06,008 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 883 transitions, 9170 flow [2024-10-14 17:09:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-14 17:09:06,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:09:06,009 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-14 17:09:06,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:09:06,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 17:09:06,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:09:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:09:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1879901099, now seen corresponding path program 2 times [2024-10-14 17:09:06,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:09:06,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851432508] [2024-10-14 17:09:06,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:09:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:09:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:09:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 17:09:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:09:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851432508] [2024-10-14 17:09:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851432508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:09:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318900706] [2024-10-14 17:09:06,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:09:06,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:09:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:09:06,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:09:06,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:09:06,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:09:06,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:09:06,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:09:06,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:09:06,840 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:09:06,840 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-14 17:09:06,945 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-14 17:09:06,973 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-14 17:09:07,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:09:07,010 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-14 17:09:07,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:09:07,060 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-14 17:09:07,117 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-14 17:09:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 17:09:07,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:09:07,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_330 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |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_330 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))) is different from false [2024-10-14 17:09:07,202 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_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |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_330 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2))))))) is different from false [2024-10-14 17:09:07,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.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 (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet16#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |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_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet16#1|)))))) is different from false [2024-10-14 17:09:07,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) (.cse1 (+ .cse2 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse3 (+ .cse2 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 (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet16#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet16#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_330 (Array Int Int))) (= (select (select (store .cse0 c_t_funThread1of2ForFork0_~p~0.base v_ArrVal_330) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet16#1|)))))) is different from false [2024-10-14 17:09:07,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:09:07,267 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-14 17:09:07,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:09:07,275 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-14 17:09:07,287 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:09:07,287 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-14 17:09:07,294 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:09:07,295 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-14 17:09:07,301 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-14 17:09:07,302 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-14 17:09:07,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2024-10-14 17:09:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318900706] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:09:07,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:09:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-10-14 17:09:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020906693] [2024-10-14 17:09:07,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:09:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:09:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:09:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:09:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=303, Unknown=4, NotChecked=156, Total=552 [2024-10-14 17:09:07,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2024-10-14 17:09:07,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 883 transitions, 9170 flow. Second operand has 24 states, 24 states have (on average 104.83333333333333) internal successors, (2516), 24 states have internal predecessors, (2516), 0 states have call successors, (0), 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-14 17:09:07,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:09:07,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2024-10-14 17:09:07,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand