./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_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 ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:55:58,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:58,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:55:58,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:58,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:58,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:58,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:58,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:58,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:58,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:58,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:55:58,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:55:58,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:55:58,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:58,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:58,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:58,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:58,992 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:55:58,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:58,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:58,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:58,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:58,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:58,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:58,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:55:58,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:58,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:58,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:58,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:58,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:58,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:55:58,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:58,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:58,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:55:58,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:55:58,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:58,997 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 -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2024-11-09 06:55:59,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:59,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:59,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:59,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:59,339 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:59,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2024-11-09 06:56:00,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:56:01,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:56:01,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2024-11-09 06:56:01,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671d71f34/ee757d72e45141b1ae799620b0f45cf9/FLAGfc81870dd [2024-11-09 06:56:01,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/671d71f34/ee757d72e45141b1ae799620b0f45cf9 [2024-11-09 06:56:01,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:56:01,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:56:01,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:01,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:56:01,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:56:01,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d83e99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01, skipping insertion in model container [2024-11-09 06:56:01,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:56:01,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:01,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:56:01,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:01,788 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:56:01,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01 WrapperNode [2024-11-09 06:56:01,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:01,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:01,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:56:01,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:56:01,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,842 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 218 [2024-11-09 06:56:01,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:01,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:56:01,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:56:01,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:56:01,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:56:01,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:56:01,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:56:01,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:56:01,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (1/1) ... [2024-11-09 06:56:01,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:56:01,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:01,949 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-11-09 06:56:01,956 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-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:56:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:56:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:56:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:56:02,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:56:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:56:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:56:02,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:56:02,002 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:56:02,142 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:56:02,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:56:02,465 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:56:02,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:56:02,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:56:02,528 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-09 06:56:02,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:02 BoogieIcfgContainer [2024-11-09 06:56:02,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:56:02,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:56:02,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:56:02,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:56:02,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:56:01" (1/3) ... [2024-11-09 06:56:02,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2af35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:02, skipping insertion in model container [2024-11-09 06:56:02,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:01" (2/3) ... [2024-11-09 06:56:02,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2af35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:02, skipping insertion in model container [2024-11-09 06:56:02,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:02" (3/3) ... [2024-11-09 06:56:02,538 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2024-11-09 06:56:02,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:56:02,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 06:56:02,554 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:56:02,633 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:56:02,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 215 transitions, 437 flow [2024-11-09 06:56:02,851 INFO L124 PetriNetUnfolderBase]: 26/284 cut-off events. [2024-11-09 06:56:02,852 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:56:02,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 284 events. 26/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1002 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 176. Up to 4 conditions per place. [2024-11-09 06:56:02,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 215 transitions, 437 flow [2024-11-09 06:56:02,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 215 transitions, 437 flow [2024-11-09 06:56:02,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:02,892 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;@7fabd5c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:02,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-09 06:56:02,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:56:02,910 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2024-11-09 06:56:02,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:56:02,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:02,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] [2024-11-09 06:56:02,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-09 06:56:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash 189687217, now seen corresponding path program 1 times [2024-11-09 06:56:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867107769] [2024-11-09 06:56:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867107769] [2024-11-09 06:56:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867107769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350487222] [2024-11-09 06:56:03,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:03,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 215 [2024-11-09 06:56:03,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 215 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-11-09 06:56:03,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:03,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 215 [2024-11-09 06:56:03,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:03,632 INFO L124 PetriNetUnfolderBase]: 122/1040 cut-off events. [2024-11-09 06:56:03,633 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:56:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1040 events. 122/1040 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6795 event pairs, 99 based on Foata normal form. 137/1064 useless extension candidates. Maximal degree in co-relation 1235. Up to 254 conditions per place. [2024-11-09 06:56:03,649 INFO L140 encePairwiseOnDemand]: 194/215 looper letters, 36 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-11-09 06:56:03,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 207 transitions, 497 flow [2024-11-09 06:56:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2024-11-09 06:56:03,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2024-11-09 06:56:03,669 INFO L175 Difference]: Start difference. First operand has 198 places, 215 transitions, 437 flow. Second operand 3 states and 580 transitions. [2024-11-09 06:56:03,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 207 transitions, 497 flow [2024-11-09 06:56:03,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 207 transitions, 497 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:03,679 INFO L231 Difference]: Finished difference. Result has 199 places, 195 transitions, 405 flow [2024-11-09 06:56:03,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=199, PETRI_TRANSITIONS=195} [2024-11-09 06:56:03,687 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 1 predicate places. [2024-11-09 06:56:03,688 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 195 transitions, 405 flow [2024-11-09 06:56:03,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-11-09 06:56:03,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:03,690 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] [2024-11-09 06:56:03,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:56:03,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-09 06:56:03,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash 888542706, now seen corresponding path program 1 times [2024-11-09 06:56:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:03,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295062068] [2024-11-09 06:56:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295062068] [2024-11-09 06:56:04,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295062068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:04,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:04,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379857550] [2024-11-09 06:56:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:04,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:04,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2024-11-09 06:56:04,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 195 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-11-09 06:56:04,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:04,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2024-11-09 06:56:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:04,752 INFO L124 PetriNetUnfolderBase]: 244/1392 cut-off events. [2024-11-09 06:56:04,753 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-09 06:56:04,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 1392 events. 244/1392 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10445 event pairs, 166 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 1861. Up to 387 conditions per place. [2024-11-09 06:56:04,763 INFO L140 encePairwiseOnDemand]: 209/215 looper letters, 80 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2024-11-09 06:56:04,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 242 transitions, 669 flow [2024-11-09 06:56:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:56:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1034 transitions. [2024-11-09 06:56:04,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8015503875968992 [2024-11-09 06:56:04,772 INFO L175 Difference]: Start difference. First operand has 199 places, 195 transitions, 405 flow. Second operand 6 states and 1034 transitions. [2024-11-09 06:56:04,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 242 transitions, 669 flow [2024-11-09 06:56:04,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 242 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:04,778 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 409 flow [2024-11-09 06:56:04,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2024-11-09 06:56:04,780 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 3 predicate places. [2024-11-09 06:56:04,781 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 409 flow [2024-11-09 06:56:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-11-09 06:56:04,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:04,782 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] [2024-11-09 06:56:04,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:56:04,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-09 06:56:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 433727298, now seen corresponding path program 1 times [2024-11-09 06:56:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40613456] [2024-11-09 06:56:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40613456] [2024-11-09 06:56:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40613456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:04,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702556454] [2024-11-09 06:56:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:04,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:04,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 215 [2024-11-09 06:56:04,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-11-09 06:56:04,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:04,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 215 [2024-11-09 06:56:04,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:05,080 INFO L124 PetriNetUnfolderBase]: 170/1602 cut-off events. [2024-11-09 06:56:05,081 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:56:05,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 1602 events. 170/1602 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12576 event pairs, 12 based on Foata normal form. 0/1433 useless extension candidates. Maximal degree in co-relation 1920. Up to 189 conditions per place. [2024-11-09 06:56:05,089 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 41 selfloop transitions, 3 changer transitions 0/214 dead transitions. [2024-11-09 06:56:05,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 214 transitions, 540 flow [2024-11-09 06:56:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2024-11-09 06:56:05,092 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8697674418604651 [2024-11-09 06:56:05,093 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 409 flow. Second operand 3 states and 561 transitions. [2024-11-09 06:56:05,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 214 transitions, 540 flow [2024-11-09 06:56:05,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 214 transitions, 530 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:56:05,099 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 421 flow [2024-11-09 06:56:05,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-11-09 06:56:05,100 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-09 06:56:05,101 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 421 flow [2024-11-09 06:56:05,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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-11-09 06:56:05,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:05,101 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] [2024-11-09 06:56:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:56:05,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-09 06:56:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1317806164, now seen corresponding path program 1 times [2024-11-09 06:56:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40531933] [2024-11-09 06:56:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40531933] [2024-11-09 06:56:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40531933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367174609] [2024-11-09 06:56:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:05,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:05,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:05,205 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-11-09 06:56:05,207 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-11-09 06:56:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:05,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:56:05,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:05,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:05,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367174609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:05,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:05,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 06:56:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422716814] [2024-11-09 06:56:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:05,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:05,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:05,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 215 [2024-11-09 06:56:05,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-11-09 06:56:05,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:05,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 215 [2024-11-09 06:56:05,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:05,691 INFO L124 PetriNetUnfolderBase]: 278/2141 cut-off events. [2024-11-09 06:56:05,691 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-09 06:56:05,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 2141 events. 278/2141 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 18016 event pairs, 204 based on Foata normal form. 0/1878 useless extension candidates. Maximal degree in co-relation 2739. Up to 497 conditions per place. [2024-11-09 06:56:05,704 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 39 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2024-11-09 06:56:05,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 211 transitions, 543 flow [2024-11-09 06:56:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2024-11-09 06:56:05,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8496124031007752 [2024-11-09 06:56:05,707 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 421 flow. Second operand 3 states and 548 transitions. [2024-11-09 06:56:05,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 211 transitions, 543 flow [2024-11-09 06:56:05,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 211 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:05,714 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 451 flow [2024-11-09 06:56:05,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-11-09 06:56:05,716 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 4 predicate places. [2024-11-09 06:56:05,716 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 451 flow [2024-11-09 06:56:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-11-09 06:56:05,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:05,717 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] [2024-11-09 06:56:05,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:56:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:05,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-09 06:56:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1447479707, now seen corresponding path program 1 times [2024-11-09 06:56:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246764519] [2024-11-09 06:56:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:56:05,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:56:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:56:05,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:56:05,981 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:56:05,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2024-11-09 06:56:05,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2024-11-09 06:56:05,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2024-11-09 06:56:05,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2024-11-09 06:56:05,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2024-11-09 06:56:05,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2024-11-09 06:56:05,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2024-11-09 06:56:05,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2024-11-09 06:56:05,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2024-11-09 06:56:05,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2024-11-09 06:56:05,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2024-11-09 06:56:05,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2024-11-09 06:56:05,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2024-11-09 06:56:05,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2024-11-09 06:56:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2024-11-09 06:56:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2024-11-09 06:56:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2024-11-09 06:56:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2024-11-09 06:56:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2024-11-09 06:56:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2024-11-09 06:56:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2024-11-09 06:56:05,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2024-11-09 06:56:05,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2024-11-09 06:56:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:56:05,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:56:05,994 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:56:05,995 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:56:06,044 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:56:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 321 transitions, 658 flow [2024-11-09 06:56:06,117 INFO L124 PetriNetUnfolderBase]: 48/487 cut-off events. [2024-11-09 06:56:06,117 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:56:06,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 487 events. 48/487 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2066 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 302. Up to 8 conditions per place. [2024-11-09 06:56:06,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 292 places, 321 transitions, 658 flow [2024-11-09 06:56:06,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 321 transitions, 658 flow [2024-11-09 06:56:06,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:06,132 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;@7fabd5c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:06,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-09 06:56:06,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:56:06,136 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2024-11-09 06:56:06,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:56:06,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:06,137 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] [2024-11-09 06:56:06,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:06,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1489206158, now seen corresponding path program 1 times [2024-11-09 06:56:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304663444] [2024-11-09 06:56:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:06,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304663444] [2024-11-09 06:56:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304663444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549782247] [2024-11-09 06:56:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:06,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:06,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:06,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 321 [2024-11-09 06:56:06,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 321 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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-11-09 06:56:06,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:06,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 321 [2024-11-09 06:56:06,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:08,754 INFO L124 PetriNetUnfolderBase]: 3460/16760 cut-off events. [2024-11-09 06:56:08,755 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2024-11-09 06:56:08,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22311 conditions, 16760 events. 3460/16760 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 209113 event pairs, 1584 based on Foata normal form. 3090/18209 useless extension candidates. Maximal degree in co-relation 1883. Up to 5465 conditions per place. [2024-11-09 06:56:08,898 INFO L140 encePairwiseOnDemand]: 288/321 looper letters, 51 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-09 06:56:08,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 302 transitions, 726 flow [2024-11-09 06:56:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2024-11-09 06:56:08,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8795430944963655 [2024-11-09 06:56:08,901 INFO L175 Difference]: Start difference. First operand has 292 places, 321 transitions, 658 flow. Second operand 3 states and 847 transitions. [2024-11-09 06:56:08,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 302 transitions, 726 flow [2024-11-09 06:56:08,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 302 transitions, 726 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:08,910 INFO L231 Difference]: Finished difference. Result has 293 places, 290 transitions, 606 flow [2024-11-09 06:56:08,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=293, PETRI_TRANSITIONS=290} [2024-11-09 06:56:08,911 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 1 predicate places. [2024-11-09 06:56:08,911 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 290 transitions, 606 flow [2024-11-09 06:56:08,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 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-11-09 06:56:08,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:08,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] [2024-11-09 06:56:08,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:56:08,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:08,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1915244397, now seen corresponding path program 1 times [2024-11-09 06:56:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085806030] [2024-11-09 06:56:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085806030] [2024-11-09 06:56:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085806030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615084997] [2024-11-09 06:56:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:09,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:09,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2024-11-09 06:56:09,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 290 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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-11-09 06:56:09,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:09,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2024-11-09 06:56:09,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:12,561 INFO L124 PetriNetUnfolderBase]: 6951/28147 cut-off events. [2024-11-09 06:56:12,561 INFO L125 PetriNetUnfolderBase]: For 345/384 co-relation queries the response was YES. [2024-11-09 06:56:12,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39106 conditions, 28147 events. 6951/28147 cut-off events. For 345/384 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 368839 event pairs, 3215 based on Foata normal form. 0/25277 useless extension candidates. Maximal degree in co-relation 38888. Up to 7803 conditions per place. [2024-11-09 06:56:12,793 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 142 selfloop transitions, 6 changer transitions 0/385 dead transitions. [2024-11-09 06:56:12,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 385 transitions, 1092 flow [2024-11-09 06:56:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:56:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1576 transitions. [2024-11-09 06:56:12,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.818276220145379 [2024-11-09 06:56:12,797 INFO L175 Difference]: Start difference. First operand has 293 places, 290 transitions, 606 flow. Second operand 6 states and 1576 transitions. [2024-11-09 06:56:12,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 385 transitions, 1092 flow [2024-11-09 06:56:12,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 385 transitions, 1090 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:12,805 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 614 flow [2024-11-09 06:56:12,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2024-11-09 06:56:12,807 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2024-11-09 06:56:12,807 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 614 flow [2024-11-09 06:56:12,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 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-11-09 06:56:12,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:12,808 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] [2024-11-09 06:56:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:56:12,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash 62047434, now seen corresponding path program 1 times [2024-11-09 06:56:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585247963] [2024-11-09 06:56:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:12,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585247963] [2024-11-09 06:56:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585247963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570201859] [2024-11-09 06:56:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:12,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 321 [2024-11-09 06:56:12,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-11-09 06:56:12,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:12,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 321 [2024-11-09 06:56:12,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:15,972 INFO L124 PetriNetUnfolderBase]: 6242/30828 cut-off events. [2024-11-09 06:56:15,972 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-11-09 06:56:16,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40778 conditions, 30828 events. 6242/30828 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 425243 event pairs, 1648 based on Foata normal form. 0/27517 useless extension candidates. Maximal degree in co-relation 38700. Up to 5556 conditions per place. [2024-11-09 06:56:16,218 INFO L140 encePairwiseOnDemand]: 314/321 looper letters, 74 selfloop transitions, 5 changer transitions 0/327 dead transitions. [2024-11-09 06:56:16,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 327 transitions, 859 flow [2024-11-09 06:56:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 06:56:16,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2024-11-09 06:56:16,222 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 614 flow. Second operand 3 states and 828 transitions. [2024-11-09 06:56:16,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 327 transitions, 859 flow [2024-11-09 06:56:16,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 327 transitions, 847 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:56:16,229 INFO L231 Difference]: Finished difference. Result has 295 places, 294 transitions, 646 flow [2024-11-09 06:56:16,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=295, PETRI_TRANSITIONS=294} [2024-11-09 06:56:16,232 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2024-11-09 06:56:16,232 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 294 transitions, 646 flow [2024-11-09 06:56:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-11-09 06:56:16,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:16,234 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] [2024-11-09 06:56:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:56:16,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1360856883, now seen corresponding path program 1 times [2024-11-09 06:56:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981202257] [2024-11-09 06:56:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981202257] [2024-11-09 06:56:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981202257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121552904] [2024-11-09 06:56:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:16,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:16,338 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-11-09 06:56:16,339 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-11-09 06:56:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:16,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:56:16,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:16,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121552904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:16,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 06:56:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993082584] [2024-11-09 06:56:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:16,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:16,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:16,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 321 [2024-11-09 06:56:16,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 294 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-11-09 06:56:16,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:16,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 321 [2024-11-09 06:56:16,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:20,759 INFO L124 PetriNetUnfolderBase]: 9743/42065 cut-off events. [2024-11-09 06:56:20,760 INFO L125 PetriNetUnfolderBase]: For 2189/2218 co-relation queries the response was YES. [2024-11-09 06:56:20,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59277 conditions, 42065 events. 9743/42065 cut-off events. For 2189/2218 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 594556 event pairs, 7040 based on Foata normal form. 24/37331 useless extension candidates. Maximal degree in co-relation 56381. Up to 12782 conditions per place. [2024-11-09 06:56:21,039 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 68 selfloop transitions, 8 changer transitions 0/324 dead transitions. [2024-11-09 06:56:21,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 324 transitions, 870 flow [2024-11-09 06:56:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2024-11-09 06:56:21,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2024-11-09 06:56:21,042 INFO L175 Difference]: Start difference. First operand has 295 places, 294 transitions, 646 flow. Second operand 3 states and 813 transitions. [2024-11-09 06:56:21,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 324 transitions, 870 flow [2024-11-09 06:56:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 324 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:21,053 INFO L231 Difference]: Finished difference. Result has 297 places, 300 transitions, 702 flow [2024-11-09 06:56:21,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=297, PETRI_TRANSITIONS=300} [2024-11-09 06:56:21,055 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 5 predicate places. [2024-11-09 06:56:21,056 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 300 transitions, 702 flow [2024-11-09 06:56:21,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-11-09 06:56:21,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:21,057 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-11-09 06:56:21,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:56:21,261 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,SelfDestructingSolverStorable8 [2024-11-09 06:56:21,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:21,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1934678822, now seen corresponding path program 1 times [2024-11-09 06:56:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309470183] [2024-11-09 06:56:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309470183] [2024-11-09 06:56:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309470183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23526590] [2024-11-09 06:56:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:21,352 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-11-09 06:56:21,353 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-11-09 06:56:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:21,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:56:21,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:21,494 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:56:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:21,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23526590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:21,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:56:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742157975] [2024-11-09 06:56:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:21,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:21,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 321 [2024-11-09 06:56:21,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 300 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-11-09 06:56:21,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:21,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 321 [2024-11-09 06:56:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:22,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [146#L897-16true, 310#true, 156#L906-3true, Black: 305#true, 291#true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 293#true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:22,740 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-11-09 06:56:22,741 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 06:56:22,741 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 06:56:22,741 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-09 06:56:22,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 291#true, 283#L897-22true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 293#true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:22,906 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-11-09 06:56:22,906 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-09 06:56:22,907 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-09 06:56:22,907 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-09 06:56:23,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 291#true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 293#true, 197#L893-35true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:23,501 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-11-09 06:56:23,501 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-09 06:56:23,502 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-09 06:56:23,502 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-09 06:56:23,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 291#true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 176#L897-35true, 293#true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:23,858 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-11-09 06:56:23,858 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:23,858 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:23,858 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:23,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 291#true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 13#L917-2true, 293#true, 197#L893-35true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:23,888 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-09 06:56:23,888 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-09 06:56:23,888 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-09 06:56:23,888 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-09 06:56:23,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 291#true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 13#L917-2true, 176#L897-35true, 293#true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:23,960 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-11-09 06:56:23,960 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:56:23,960 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:56:23,960 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:56:24,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][255], [310#true, Black: 305#true, 156#L906-3true, 480#true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 22#L918-10true, 290#true, 293#true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:24,357 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-09 06:56:24,357 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:56:24,357 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:56:24,357 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-09 06:56:24,827 INFO L124 PetriNetUnfolderBase]: 5023/29184 cut-off events. [2024-11-09 06:56:24,827 INFO L125 PetriNetUnfolderBase]: For 1163/1218 co-relation queries the response was YES. [2024-11-09 06:56:24,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39324 conditions, 29184 events. 5023/29184 cut-off events. For 1163/1218 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 416356 event pairs, 3005 based on Foata normal form. 68/26855 useless extension candidates. Maximal degree in co-relation 37486. Up to 7085 conditions per place. [2024-11-09 06:56:25,031 INFO L140 encePairwiseOnDemand]: 303/321 looper letters, 47 selfloop transitions, 18 changer transitions 0/328 dead transitions. [2024-11-09 06:56:25,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 328 transitions, 887 flow [2024-11-09 06:56:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2024-11-09 06:56:25,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8650051921079959 [2024-11-09 06:56:25,037 INFO L175 Difference]: Start difference. First operand has 297 places, 300 transitions, 702 flow. Second operand 3 states and 833 transitions. [2024-11-09 06:56:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 328 transitions, 887 flow [2024-11-09 06:56:25,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 328 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:25,058 INFO L231 Difference]: Finished difference. Result has 298 places, 313 transitions, 788 flow [2024-11-09 06:56:25,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=298, PETRI_TRANSITIONS=313} [2024-11-09 06:56:25,059 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 6 predicate places. [2024-11-09 06:56:25,059 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 313 transitions, 788 flow [2024-11-09 06:56:25,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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-11-09 06:56:25,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:25,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:25,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:56:25,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:25,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:25,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:25,262 INFO L85 PathProgramCache]: Analyzing trace with hash -620157738, now seen corresponding path program 1 times [2024-11-09 06:56:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:25,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317372804] [2024-11-09 06:56:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:25,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317372804] [2024-11-09 06:56:25,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317372804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:25,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:25,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371728228] [2024-11-09 06:56:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:25,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:25,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:25,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 321 [2024-11-09 06:56:25,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 313 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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-11-09 06:56:25,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:25,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 321 [2024-11-09 06:56:25,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:39,922 INFO L124 PetriNetUnfolderBase]: 39029/135404 cut-off events. [2024-11-09 06:56:39,923 INFO L125 PetriNetUnfolderBase]: For 23478/24121 co-relation queries the response was YES. [2024-11-09 06:56:40,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226646 conditions, 135404 events. 39029/135404 cut-off events. For 23478/24121 co-relation queries the response was YES. Maximal size of possible extension queue 3497. Compared 2109577 event pairs, 13555 based on Foata normal form. 20/122489 useless extension candidates. Maximal degree in co-relation 222066. Up to 32979 conditions per place. [2024-11-09 06:56:41,077 INFO L140 encePairwiseOnDemand]: 286/321 looper letters, 132 selfloop transitions, 26 changer transitions 0/387 dead transitions. [2024-11-09 06:56:41,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 387 transitions, 1347 flow [2024-11-09 06:56:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-11-09 06:56:41,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8307372793354102 [2024-11-09 06:56:41,080 INFO L175 Difference]: Start difference. First operand has 298 places, 313 transitions, 788 flow. Second operand 3 states and 800 transitions. [2024-11-09 06:56:41,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 387 transitions, 1347 flow [2024-11-09 06:56:41,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 387 transitions, 1311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:41,120 INFO L231 Difference]: Finished difference. Result has 301 places, 339 transitions, 996 flow [2024-11-09 06:56:41,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=996, PETRI_PLACES=301, PETRI_TRANSITIONS=339} [2024-11-09 06:56:41,121 INFO L277 CegarLoopForPetriNet]: 292 programPoint places, 9 predicate places. [2024-11-09 06:56:41,121 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 339 transitions, 996 flow [2024-11-09 06:56:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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-11-09 06:56:41,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:41,122 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-11-09 06:56:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:56:41,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-09 06:56:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1239859958, now seen corresponding path program 1 times [2024-11-09 06:56:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134546556] [2024-11-09 06:56:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134546556] [2024-11-09 06:56:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134546556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520831513] [2024-11-09 06:56:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:41,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 321 [2024-11-09 06:56:41,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 339 transitions, 996 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-11-09 06:56:41,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:41,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 321 [2024-11-09 06:56:41,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:46,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][251], [666#(= |#race~global~0| 0), 156#L906-3true, Black: 305#true, 291#true, Black: 641#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 664#true, 669#true, 293#true, 287#L916-12true, 212#L897-24true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:46,117 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-11-09 06:56:46,117 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:56:46,117 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:56:46,117 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-09 06:56:48,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][251], [Black: 305#true, 156#L906-3true, 291#true, Black: 641#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), 242#L897-29true, Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 664#true, Black: 666#(= |#race~global~0| 0), 669#true, 293#true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:48,003 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-09 06:56:48,004 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:56:48,004 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:56:48,004 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-09 06:56:49,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][251], [Black: 305#true, 156#L906-3true, 291#true, Black: 641#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 664#true, Black: 666#(= |#race~global~0| 0), 176#L897-35true, 669#true, 293#true, 287#L916-12true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:49,467 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-11-09 06:56:49,467 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:49,467 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:49,467 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-09 06:56:50,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L906-->L906-3: Formula: (and (= (store |v_#pthreadsMutex_138| |v_~#fm~0.base_25| (store (select |v_#pthreadsMutex_138| |v_~#fm~0.base_25|) |v_~#fm~0.offset_25| 0)) |v_#pthreadsMutex_137|) (= |v_t_funThread2of2ForFork0_#t~ret23#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_138|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_137|, ~#fm~0.base=|v_~#fm~0.base_25|, ~#fm~0.offset=|v_~#fm~0.offset_25|, t_funThread2of2ForFork0_#t~ret23#1=|v_t_funThread2of2ForFork0_#t~ret23#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_#t~ret23#1][251], [Black: 305#true, 156#L906-3true, 291#true, Black: 641#(= (select (select |#pthreadsMutex| |~#fm~0.base|) |~#fm~0.offset|) 1), Black: 297#(= |ULTIMATE.start_main_~i~0#1| 0), 13#L917-2true, 664#true, Black: 666#(= |#race~global~0| 0), 669#true, 176#L897-35true, 293#true, Black: 477#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet29#1|)]) [2024-11-09 06:56:50,689 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-11-09 06:56:50,689 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:56:50,689 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-09 06:56:50,689 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event