./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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_06-cond_racing1.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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:39:14,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:39:15,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:39:15,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:39:15,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:39:15,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:39:15,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:39:15,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:39:15,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:39:15,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:39:15,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:39:15,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:39:15,092 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:39:15,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:39:15,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:39:15,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:39:15,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:39:15,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:39:15,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:39:15,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:39:15,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:39:15,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:39:15,095 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:39:15,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:39:15,096 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:39:15,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:39:15,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:39:15,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:39:15,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:39:15,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:39:15,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:39:15,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:15,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:39:15,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:39:15,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:39:15,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:39:15,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:39:15,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:39:15,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:39:15,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:39:15,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:39:15,100 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2024-11-16 23:39:15,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:39:15,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:39:15,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:39:15,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:39:15,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:39:15,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-16 23:39:16,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:39:17,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:39:17,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-16 23:39:17,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd568de9/ec708fdc8a0a497eadbc4fd00ca716ad/FLAG700ec5f57 [2024-11-16 23:39:17,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd568de9/ec708fdc8a0a497eadbc4fd00ca716ad [2024-11-16 23:39:17,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:39:17,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:39:17,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:17,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:39:17,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:39:17,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:17,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4611e2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17, skipping insertion in model container [2024-11-16 23:39:17,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:17,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:39:17,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:17,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:39:17,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:17,938 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:39:17,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17 WrapperNode [2024-11-16 23:39:17,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:17,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:17,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:39:17,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:39:17,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:17,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,006 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-16 23:39:18,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:18,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:39:18,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:39:18,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:39:18,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:39:18,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:39:18,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:39:18,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:39:18,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (1/1) ... [2024-11-16 23:39:18,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:18,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:18,088 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-16 23:39:18,090 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-16 23:39:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:39:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:39:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:39:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:39:18,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:39:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:39:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:39:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 23:39:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 23:39:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:39:18,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:39:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:39:18,134 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:39:18,265 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:39:18,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:39:18,466 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 23:39:18,467 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-16 23:39:18,531 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:39:18,532 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:39:18,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:39:18,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:39:18,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:18 BoogieIcfgContainer [2024-11-16 23:39:18,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:39:18,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:39:18,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:39:18,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:39:18,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:17" (1/3) ... [2024-11-16 23:39:18,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc851e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:18, skipping insertion in model container [2024-11-16 23:39:18,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:17" (2/3) ... [2024-11-16 23:39:18,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc851e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:18, skipping insertion in model container [2024-11-16 23:39:18,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:18" (3/3) ... [2024-11-16 23:39:18,590 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-11-16 23:39:18,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:39:18,605 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-16 23:39:18,605 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:39:18,675 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:39:18,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 166 transitions, 339 flow [2024-11-16 23:39:18,821 INFO L124 PetriNetUnfolderBase]: 25/238 cut-off events. [2024-11-16 23:39:18,821 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:39:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 238 events. 25/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 715 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 124. Up to 6 conditions per place. [2024-11-16 23:39:18,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 166 transitions, 339 flow [2024-11-16 23:39:18,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 166 transitions, 339 flow [2024-11-16 23:39:18,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:18,857 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;@7b5f2ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:18,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-16 23:39:18,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:18,882 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-16 23:39:18,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:18,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:18,884 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] [2024-11-16 23:39:18,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:18,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2123364355, now seen corresponding path program 1 times [2024-11-16 23:39:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919377847] [2024-11-16 23:39:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:19,800 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-16 23:39:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919377847] [2024-11-16 23:39:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919377847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861559844] [2024-11-16 23:39:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:20,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 166 [2024-11-16 23:39:20,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 166 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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-16 23:39:20,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:20,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 166 [2024-11-16 23:39:20,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:20,346 INFO L124 PetriNetUnfolderBase]: 129/867 cut-off events. [2024-11-16 23:39:20,347 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:39:20,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 867 events. 129/867 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5279 event pairs, 40 based on Foata normal form. 152/929 useless extension candidates. Maximal degree in co-relation 1001. Up to 188 conditions per place. [2024-11-16 23:39:20,355 INFO L140 encePairwiseOnDemand]: 148/166 looper letters, 48 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-16 23:39:20,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 175 transitions, 463 flow [2024-11-16 23:39:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2024-11-16 23:39:20,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8313253012048193 [2024-11-16 23:39:20,379 INFO L175 Difference]: Start difference. First operand has 153 places, 166 transitions, 339 flow. Second operand 6 states and 828 transitions. [2024-11-16 23:39:20,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 175 transitions, 463 flow [2024-11-16 23:39:20,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 175 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:20,388 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 319 flow [2024-11-16 23:39:20,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2024-11-16 23:39:20,395 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 2 predicate places. [2024-11-16 23:39:20,396 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 319 flow [2024-11-16 23:39:20,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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-16 23:39:20,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:20,397 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-16 23:39:20,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:39:20,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:20,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1203701937, now seen corresponding path program 1 times [2024-11-16 23:39:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166515972] [2024-11-16 23:39:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:20,457 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-16 23:39:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166515972] [2024-11-16 23:39:20,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166515972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:20,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351378980] [2024-11-16 23:39:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:20,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 166 [2024-11-16 23:39:20,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-16 23:39:20,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:20,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 166 [2024-11-16 23:39:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:20,599 INFO L124 PetriNetUnfolderBase]: 67/664 cut-off events. [2024-11-16 23:39:20,599 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-16 23:39:20,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 664 events. 67/664 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3638 event pairs, 29 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 724. Up to 116 conditions per place. [2024-11-16 23:39:20,604 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 22 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-16 23:39:20,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 379 flow [2024-11-16 23:39:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2024-11-16 23:39:20,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8634538152610441 [2024-11-16 23:39:20,606 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 319 flow. Second operand 3 states and 430 transitions. [2024-11-16 23:39:20,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 157 transitions, 379 flow [2024-11-16 23:39:20,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 157 transitions, 369 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:20,610 INFO L231 Difference]: Finished difference. Result has 153 places, 151 transitions, 317 flow [2024-11-16 23:39:20,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=153, PETRI_TRANSITIONS=151} [2024-11-16 23:39:20,611 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2024-11-16 23:39:20,611 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 151 transitions, 317 flow [2024-11-16 23:39:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-16 23:39:20,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:20,612 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] [2024-11-16 23:39:20,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:39:20,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 321602459, now seen corresponding path program 1 times [2024-11-16 23:39:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683262654] [2024-11-16 23:39:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:20,670 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-16 23:39:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683262654] [2024-11-16 23:39:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683262654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220931435] [2024-11-16 23:39:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:20,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 166 [2024-11-16 23:39:20,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 151 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-16 23:39:20,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:20,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 166 [2024-11-16 23:39:20,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:20,868 INFO L124 PetriNetUnfolderBase]: 134/911 cut-off events. [2024-11-16 23:39:20,869 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-16 23:39:20,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 911 events. 134/911 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5560 event pairs, 33 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1113. Up to 130 conditions per place. [2024-11-16 23:39:20,877 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 30 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-16 23:39:20,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 418 flow [2024-11-16 23:39:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2024-11-16 23:39:20,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614457831325302 [2024-11-16 23:39:20,880 INFO L175 Difference]: Start difference. First operand has 153 places, 151 transitions, 317 flow. Second operand 3 states and 429 transitions. [2024-11-16 23:39:20,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 418 flow [2024-11-16 23:39:20,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 164 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:20,886 INFO L231 Difference]: Finished difference. Result has 153 places, 153 transitions, 351 flow [2024-11-16 23:39:20,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=153, PETRI_TRANSITIONS=153} [2024-11-16 23:39:20,890 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2024-11-16 23:39:20,890 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 153 transitions, 351 flow [2024-11-16 23:39:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-16 23:39:20,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:20,890 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] [2024-11-16 23:39:20,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:39:20,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:20,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1581728777, now seen corresponding path program 1 times [2024-11-16 23:39:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:20,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655037922] [2024-11-16 23:39:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:20,949 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-16 23:39:20,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655037922] [2024-11-16 23:39:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655037922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089054182] [2024-11-16 23:39:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:20,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2024-11-16 23:39:20,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 153 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-16 23:39:20,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:20,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2024-11-16 23:39:20,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:21,144 INFO L124 PetriNetUnfolderBase]: 139/983 cut-off events. [2024-11-16 23:39:21,144 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-16 23:39:21,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 983 events. 139/983 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6297 event pairs, 57 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1281. Up to 220 conditions per place. [2024-11-16 23:39:21,150 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 27 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2024-11-16 23:39:21,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 160 transitions, 431 flow [2024-11-16 23:39:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2024-11-16 23:39:21,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8534136546184738 [2024-11-16 23:39:21,152 INFO L175 Difference]: Start difference. First operand has 153 places, 153 transitions, 351 flow. Second operand 3 states and 425 transitions. [2024-11-16 23:39:21,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 160 transitions, 431 flow [2024-11-16 23:39:21,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 160 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:21,158 INFO L231 Difference]: Finished difference. Result has 155 places, 156 transitions, 371 flow [2024-11-16 23:39:21,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=155, PETRI_TRANSITIONS=156} [2024-11-16 23:39:21,160 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, 2 predicate places. [2024-11-16 23:39:21,160 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 156 transitions, 371 flow [2024-11-16 23:39:21,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-16 23:39:21,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:21,161 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:39:21,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-16 23:39:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1199061986, now seen corresponding path program 1 times [2024-11-16 23:39:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012964075] [2024-11-16 23:39:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:21,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:21,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:21,257 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:21,258 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-16 23:39:21,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-16 23:39:21,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-16 23:39:21,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-16 23:39:21,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-16 23:39:21,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-16 23:39:21,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-16 23:39:21,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-16 23:39:21,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-16 23:39:21,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-16 23:39:21,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-16 23:39:21,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-16 23:39:21,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:39:21,263 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 23:39:21,267 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:21,267 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:39:21,302 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:39:21,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 217 transitions, 450 flow [2024-11-16 23:39:21,350 INFO L124 PetriNetUnfolderBase]: 43/390 cut-off events. [2024-11-16 23:39:21,350 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:39:21,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 390 events. 43/390 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1357 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 240. Up to 9 conditions per place. [2024-11-16 23:39:21,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 217 transitions, 450 flow [2024-11-16 23:39:21,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 217 transitions, 450 flow [2024-11-16 23:39:21,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:21,361 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;@7b5f2ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:21,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-16 23:39:21,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:21,366 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-16 23:39:21,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:21,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:21,366 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] [2024-11-16 23:39:21,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -741757700, now seen corresponding path program 1 times [2024-11-16 23:39:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074841168] [2024-11-16 23:39:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:21,681 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-16 23:39:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074841168] [2024-11-16 23:39:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074841168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478371047] [2024-11-16 23:39:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:21,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:21,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 217 [2024-11-16 23:39:21,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 217 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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-16 23:39:21,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:21,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 217 [2024-11-16 23:39:21,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:22,712 INFO L124 PetriNetUnfolderBase]: 1710/6320 cut-off events. [2024-11-16 23:39:22,713 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-16 23:39:22,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9035 conditions, 6320 events. 1710/6320 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 61965 event pairs, 222 based on Foata normal form. 1927/7657 useless extension candidates. Maximal degree in co-relation 1185. Up to 1840 conditions per place. [2024-11-16 23:39:22,760 INFO L140 encePairwiseOnDemand]: 193/217 looper letters, 80 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2024-11-16 23:39:22,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 244 transitions, 674 flow [2024-11-16 23:39:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1112 transitions. [2024-11-16 23:39:22,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8540706605222734 [2024-11-16 23:39:22,763 INFO L175 Difference]: Start difference. First operand has 199 places, 217 transitions, 450 flow. Second operand 6 states and 1112 transitions. [2024-11-16 23:39:22,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 244 transitions, 674 flow [2024-11-16 23:39:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 244 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:22,768 INFO L231 Difference]: Finished difference. Result has 201 places, 196 transitions, 418 flow [2024-11-16 23:39:22,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=418, PETRI_PLACES=201, PETRI_TRANSITIONS=196} [2024-11-16 23:39:22,769 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 2 predicate places. [2024-11-16 23:39:22,770 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 196 transitions, 418 flow [2024-11-16 23:39:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 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-16 23:39:22,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:22,771 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-16 23:39:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:39:22,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2125413743, now seen corresponding path program 1 times [2024-11-16 23:39:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572265170] [2024-11-16 23:39:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:22,812 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-16 23:39:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572265170] [2024-11-16 23:39:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572265170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:22,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143048677] [2024-11-16 23:39:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:22,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 217 [2024-11-16 23:39:22,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 196 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-16 23:39:22,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:22,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 217 [2024-11-16 23:39:22,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:23,629 INFO L124 PetriNetUnfolderBase]: 987/5297 cut-off events. [2024-11-16 23:39:23,629 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-11-16 23:39:23,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6918 conditions, 5297 events. 987/5297 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 52273 event pairs, 666 based on Foata normal form. 1/4721 useless extension candidates. Maximal degree in co-relation 5154. Up to 1468 conditions per place. [2024-11-16 23:39:23,668 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-11-16 23:39:23,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 203 transitions, 500 flow [2024-11-16 23:39:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-11-16 23:39:23,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8448540706605223 [2024-11-16 23:39:23,671 INFO L175 Difference]: Start difference. First operand has 201 places, 196 transitions, 418 flow. Second operand 3 states and 550 transitions. [2024-11-16 23:39:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 203 transitions, 500 flow [2024-11-16 23:39:23,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 203 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:23,675 INFO L231 Difference]: Finished difference. Result has 199 places, 197 transitions, 420 flow [2024-11-16 23:39:23,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=199, PETRI_TRANSITIONS=197} [2024-11-16 23:39:23,676 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 0 predicate places. [2024-11-16 23:39:23,677 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 197 transitions, 420 flow [2024-11-16 23:39:23,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-16 23:39:23,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:23,678 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] [2024-11-16 23:39:23,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:39:23,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2067936227, now seen corresponding path program 1 times [2024-11-16 23:39:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63302239] [2024-11-16 23:39:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:23,719 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-16 23:39:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63302239] [2024-11-16 23:39:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63302239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:23,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084679664] [2024-11-16 23:39:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:23,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:23,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:23,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 217 [2024-11-16 23:39:23,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-16 23:39:23,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:23,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 217 [2024-11-16 23:39:23,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:24,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 197#true, 212#true]) [2024-11-16 23:39:24,614 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2024-11-16 23:39:24,614 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-16 23:39:24,614 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:39:24,614 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:39:25,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 16#t_funENTRYtrue, 197#true, 212#true]) [2024-11-16 23:39:25,230 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-16 23:39:25,230 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:25,230 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:25,230 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:25,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 88#L938true, 197#true, 212#true]) [2024-11-16 23:39:25,231 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-16 23:39:25,231 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-16 23:39:25,231 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:25,231 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:25,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 157#t_funENTRYtrue, 198#true, 212#true]) [2024-11-16 23:39:25,242 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-16 23:39:25,243 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:25,243 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:25,243 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:25,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, 24#L938true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-16 23:39:25,284 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-16 23:39:25,284 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:25,284 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-16 23:39:25,284 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:25,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 141#L939-36true, 197#true, 212#true]) [2024-11-16 23:39:25,411 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-16 23:39:25,411 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:25,411 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:25,411 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-16 23:39:25,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 96#L939-36true, 198#true, 212#true]) [2024-11-16 23:39:25,418 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-16 23:39:25,418 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:25,418 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-16 23:39:25,419 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:25,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 208#true, 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 19#L939-34true, 197#true]) [2024-11-16 23:39:25,473 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-16 23:39:25,474 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:39:25,474 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-16 23:39:25,474 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-16 23:39:25,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 31#L939-33true, 197#true]) [2024-11-16 23:39:25,507 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-16 23:39:25,507 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-16 23:39:25,508 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-16 23:39:25,508 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:39:25,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 19#L939-34true, 197#true, 212#true]) [2024-11-16 23:39:25,509 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is not cut-off event [2024-11-16 23:39:25,509 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-16 23:39:25,509 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-11-16 23:39:25,509 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-11-16 23:39:25,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 166#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 197#true, 212#true]) [2024-11-16 23:39:25,510 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-16 23:39:25,510 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:39:25,510 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-16 23:39:25,510 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-16 23:39:25,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 31#L939-33true, 197#true, 212#true]) [2024-11-16 23:39:25,542 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-11-16 23:39:25,542 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-16 23:39:25,542 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-11-16 23:39:25,542 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-16 23:39:25,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [5#L939-29true, 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 197#true, 212#true]) [2024-11-16 23:39:25,624 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-16 23:39:25,624 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-16 23:39:25,625 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-11-16 23:39:25,625 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-16 23:39:25,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [38#L939-29true, 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-16 23:39:25,657 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-11-16 23:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-16 23:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:25,657 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:25,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 104#L939-23true, 197#true, 212#true]) [2024-11-16 23:39:25,812 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-16 23:39:25,812 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-16 23:39:25,812 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:39:25,812 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:39:25,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 121#L939-23true, 212#true]) [2024-11-16 23:39:25,823 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2024-11-16 23:39:25,823 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-11-16 23:39:25,824 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-11-16 23:39:25,824 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-11-16 23:39:25,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 190#L939-17true, 197#true, 212#true]) [2024-11-16 23:39:25,855 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-16 23:39:25,855 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:39:25,855 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:39:25,855 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-16 23:39:25,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 135#L939-17true, 198#true, 212#true]) [2024-11-16 23:39:25,864 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is not cut-off event [2024-11-16 23:39:25,864 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is not cut-off event [2024-11-16 23:39:25,865 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-16 23:39:25,865 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-11-16 23:39:25,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 134#L939-15true]) [2024-11-16 23:39:25,865 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-16 23:39:25,865 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:25,865 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,865 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 22#L939-15true, 197#true, 212#true]) [2024-11-16 23:39:25,880 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-11-16 23:39:25,880 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,880 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,880 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:25,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 155#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 197#true, 212#true]) [2024-11-16 23:39:25,881 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][226], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 148#L939-14true]) [2024-11-16 23:39:25,881 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 134#L939-15true, 212#true]) [2024-11-16 23:39:25,882 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true, 94#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-16 23:39:25,882 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-16 23:39:25,882 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 159#L939-14true, 197#true, 212#true]) [2024-11-16 23:39:25,888 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,888 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2024-11-16 23:39:25,888 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:39:25,888 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:39:25,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 148#L939-14true, 212#true]) [2024-11-16 23:39:25,889 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-11-16 23:39:25,889 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:39:25,889 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is not cut-off event [2024-11-16 23:39:25,889 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:39:25,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, 42#L939-10true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 198#true, 212#true]) [2024-11-16 23:39:25,917 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-11-16 23:39:25,917 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-16 23:39:25,917 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-16 23:39:25,917 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is not cut-off event [2024-11-16 23:39:25,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 159#L939-14true, 197#true]) [2024-11-16 23:39:25,931 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2024-11-16 23:39:25,931 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,931 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,931 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:39:25,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 22#L939-15true, 197#true]) [2024-11-16 23:39:25,931 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 99#L939-10true, 197#true, 212#true]) [2024-11-16 23:39:25,932 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-16 23:39:25,932 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-16 23:39:25,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 73#L939-4true, 197#true, 212#true]) [2024-11-16 23:39:25,937 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-16 23:39:25,938 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:39:25,938 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:39:25,938 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-16 23:39:25,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 131#L939-4true, 198#true, 212#true]) [2024-11-16 23:39:25,944 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-16 23:39:25,944 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2024-11-16 23:39:25,944 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-16 23:39:25,944 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-16 23:39:25,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 12#L940true, 197#true, 212#true]) [2024-11-16 23:39:25,958 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-16 23:39:25,958 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:25,959 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:25,959 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-16 23:39:25,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 11#L940true, 198#true, 212#true]) [2024-11-16 23:39:25,962 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2024-11-16 23:39:25,962 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-16 23:39:25,962 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:25,962 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:25,981 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][196], [139#L952-4true, 208#true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, 197#true, 212#true]) [2024-11-16 23:39:25,982 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-11-16 23:39:25,982 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-16 23:39:25,982 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:39:25,982 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:39:25,982 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-16 23:39:25,988 INFO L124 PetriNetUnfolderBase]: 4692/16173 cut-off events. [2024-11-16 23:39:25,989 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2024-11-16 23:39:26,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23487 conditions, 16173 events. 4692/16173 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 183380 event pairs, 1302 based on Foata normal form. 0/14298 useless extension candidates. Maximal degree in co-relation 23425. Up to 3640 conditions per place. [2024-11-16 23:39:26,122 INFO L140 encePairwiseOnDemand]: 198/217 looper letters, 58 selfloop transitions, 14 changer transitions 0/230 dead transitions. [2024-11-16 23:39:26,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 641 flow [2024-11-16 23:39:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-11-16 23:39:26,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2024-11-16 23:39:26,125 INFO L175 Difference]: Start difference. First operand has 199 places, 197 transitions, 420 flow. Second operand 3 states and 554 transitions. [2024-11-16 23:39:26,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 641 flow [2024-11-16 23:39:26,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:39:26,130 INFO L231 Difference]: Finished difference. Result has 202 places, 211 transitions, 540 flow [2024-11-16 23:39:26,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=202, PETRI_TRANSITIONS=211} [2024-11-16 23:39:26,131 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 3 predicate places. [2024-11-16 23:39:26,131 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 211 transitions, 540 flow [2024-11-16 23:39:26,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-16 23:39:26,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:26,132 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] [2024-11-16 23:39:26,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:39:26,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:26,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash -374566072, now seen corresponding path program 1 times [2024-11-16 23:39:26,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480030119] [2024-11-16 23:39:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:26,173 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-16 23:39:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480030119] [2024-11-16 23:39:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480030119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804910764] [2024-11-16 23:39:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:26,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-16 23:39:26,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 211 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-16 23:39:26,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:26,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-16 23:39:26,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:27,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-16 23:39:27,089 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2024-11-16 23:39:27,089 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:39:27,089 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-16 23:39:27,089 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-11-16 23:39:27,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 16#t_funENTRYtrue, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-16 23:39:27,890 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-16 23:39:27,890 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:27,890 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:27,890 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:27,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 157#t_funENTRYtrue, 198#true, 217#true, 212#true]) [2024-11-16 23:39:27,902 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-11-16 23:39:27,902 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:27,902 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-11-16 23:39:27,902 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-16 23:39:27,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 24#L938true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-16 23:39:27,948 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-16 23:39:27,948 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:27,948 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-16 23:39:27,948 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-16 23:39:28,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 96#L939-36true, 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,109 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-16 23:39:28,109 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:28,110 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-16 23:39:28,110 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-16 23:39:28,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 114#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,336 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2024-11-16 23:39:28,337 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-16 23:39:28,337 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-16 23:39:28,337 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-16 23:39:28,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 8#L939-26true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,389 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-11-16 23:39:28,389 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is not cut-off event [2024-11-16 23:39:28,389 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-16 23:39:28,390 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-16 23:39:28,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 198#true, 217#true, 121#L939-23true, 212#true]) [2024-11-16 23:39:28,390 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-16 23:39:28,390 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:39:28,390 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-16 23:39:28,390 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:39:28,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 214#(= |#race~global~0| 0), 199#true, 135#L939-17true, 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,448 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-16 23:39:28,448 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-16 23:39:28,448 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:39:28,448 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-16 23:39:28,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [214#(= |#race~global~0| 0), 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 212#true, 134#L939-15true, 198#true, 217#true]) [2024-11-16 23:39:28,479 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-16 23:39:28,479 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:28,479 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:28,480 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:28,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, 42#L939-10true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,533 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-16 23:39:28,533 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-16 23:39:28,533 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-16 23:39:28,533 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-16 23:39:28,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, 99#L939-10true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-16 23:39:28,541 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-11-16 23:39:28,541 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is not cut-off event [2024-11-16 23:39:28,541 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-16 23:39:28,541 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-16 23:39:28,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [214#(= |#race~global~0| 0), 139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 212#true, 22#L939-15true, 197#true, 217#true]) [2024-11-16 23:39:28,555 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-16 23:39:28,555 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:28,555 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-16 23:39:28,555 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:39:28,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 131#L939-4true, 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,559 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-16 23:39:28,559 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:39:28,559 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-16 23:39:28,559 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-16 23:39:28,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 214#(= |#race~global~0| 0), 73#L939-4true, 197#true, 217#true, 212#true]) [2024-11-16 23:39:28,565 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-16 23:39:28,565 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is not cut-off event [2024-11-16 23:39:28,565 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-16 23:39:28,565 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-11-16 23:39:28,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([692] t_funEXIT-->L952-4: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][225], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 11#L940true, 198#true, 217#true, 212#true]) [2024-11-16 23:39:28,582 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-16 23:39:28,582 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:28,582 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-16 23:39:28,582 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-16 23:39:28,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 200#true, Black: 214#(= |#race~global~0| 0), 12#L940true, 197#true, 217#true, 212#true]) [2024-11-16 23:39:28,585 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2024-11-16 23:39:28,585 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:28,701 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-11-16 23:39:28,701 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-16 23:39:28,708 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([691] t_funEXIT-->L952-4: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [139#L952-4true, Black: 210#(= |ULTIMATE.start_main_~i~1#1| 0), 199#true, Black: 214#(= |#race~global~0| 0), 197#true, 217#true, 212#true]) [2024-11-16 23:39:28,708 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-11-16 23:39:28,709 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:39:28,709 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-16 23:39:28,709 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:39:28,709 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-16 23:39:28,723 INFO L124 PetriNetUnfolderBase]: 4837/19352 cut-off events. [2024-11-16 23:39:28,723 INFO L125 PetriNetUnfolderBase]: For 4548/4745 co-relation queries the response was YES. [2024-11-16 23:39:28,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30772 conditions, 19352 events. 4837/19352 cut-off events. For 4548/4745 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 238307 event pairs, 2184 based on Foata normal form. 49/17354 useless extension candidates. Maximal degree in co-relation 15688. Up to 6095 conditions per place. [2024-11-16 23:39:28,849 INFO L140 encePairwiseOnDemand]: 208/217 looper letters, 52 selfloop transitions, 14 changer transitions 0/235 dead transitions. [2024-11-16 23:39:28,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 235 transitions, 758 flow [2024-11-16 23:39:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2024-11-16 23:39:28,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2024-11-16 23:39:28,852 INFO L175 Difference]: Start difference. First operand has 202 places, 211 transitions, 540 flow. Second operand 3 states and 548 transitions. [2024-11-16 23:39:28,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 235 transitions, 758 flow [2024-11-16 23:39:28,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 235 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:28,865 INFO L231 Difference]: Finished difference. Result has 204 places, 223 transitions, 638 flow [2024-11-16 23:39:28,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=204, PETRI_TRANSITIONS=223} [2024-11-16 23:39:28,866 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, 5 predicate places. [2024-11-16 23:39:28,866 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 223 transitions, 638 flow [2024-11-16 23:39:28,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-16 23:39:28,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:28,867 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:39:28,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1576991182, now seen corresponding path program 1 times [2024-11-16 23:39:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:28,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875391139] [2024-11-16 23:39:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875391139] [2024-11-16 23:39:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875391139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:39:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860971572] [2024-11-16 23:39:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:28,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:39:28,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:28,971 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-16 23:39:28,972 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-16 23:39:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:29,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:39:29,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:39:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:29,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:39:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:39:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860971572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:39:29,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:39:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:39:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888081832] [2024-11-16 23:39:29,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:39:29,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:39:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:39:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:39:29,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 217 [2024-11-16 23:39:29,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 223 transitions, 638 flow. Second operand has 10 states, 10 states have (on average 171.1) internal successors, (1711), 10 states have internal predecessors, (1711), 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-16 23:39:29,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:29,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 217 [2024-11-16 23:39:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:29,808 INFO L124 PetriNetUnfolderBase]: 703/3085 cut-off events. [2024-11-16 23:39:29,809 INFO L125 PetriNetUnfolderBase]: For 379/396 co-relation queries the response was YES. [2024-11-16 23:39:29,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 3085 events. 703/3085 cut-off events. For 379/396 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 26746 event pairs, 14 based on Foata normal form. 106/3053 useless extension candidates. Maximal degree in co-relation 2369. Up to 478 conditions per place. [2024-11-16 23:39:29,835 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 72 selfloop transitions, 7 changer transitions 0/218 dead transitions. [2024-11-16 23:39:29,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 218 transitions, 740 flow [2024-11-16 23:39:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:39:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:39:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1602 transitions. [2024-11-16 23:39:29,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2024-11-16 23:39:29,841 INFO L175 Difference]: Start difference. First operand has 204 places, 223 transitions, 638 flow. Second operand 9 states and 1602 transitions. [2024-11-16 23:39:29,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 218 transitions, 740 flow [2024-11-16 23:39:29,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 218 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:29,847 INFO L231 Difference]: Finished difference. Result has 158 places, 162 transitions, 464 flow [2024-11-16 23:39:29,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=158, PETRI_TRANSITIONS=162} [2024-11-16 23:39:29,849 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -41 predicate places. [2024-11-16 23:39:29,849 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 464 flow [2024-11-16 23:39:29,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 171.1) internal successors, (1711), 10 states have internal predecessors, (1711), 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-16 23:39:29,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:29,851 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:29,870 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-16 23:39:30,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 23:39:30,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:30,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1569013903, now seen corresponding path program 1 times [2024-11-16 23:39:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:30,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026508675] [2024-11-16 23:39:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:39:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026508675] [2024-11-16 23:39:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026508675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202739740] [2024-11-16 23:39:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:30,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-16 23:39:30,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-16 23:39:30,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:30,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-16 23:39:30,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:30,453 INFO L124 PetriNetUnfolderBase]: 260/1337 cut-off events. [2024-11-16 23:39:30,453 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-11-16 23:39:30,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 1337 events. 260/1337 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8996 event pairs, 132 based on Foata normal form. 7/1250 useless extension candidates. Maximal degree in co-relation 2299. Up to 459 conditions per place. [2024-11-16 23:39:30,460 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 42 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2024-11-16 23:39:30,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 176 transitions, 616 flow [2024-11-16 23:39:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2024-11-16 23:39:30,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2024-11-16 23:39:30,463 INFO L175 Difference]: Start difference. First operand has 158 places, 162 transitions, 464 flow. Second operand 3 states and 534 transitions. [2024-11-16 23:39:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 176 transitions, 616 flow [2024-11-16 23:39:30,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 176 transitions, 601 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:30,467 INFO L231 Difference]: Finished difference. Result has 157 places, 170 transitions, 547 flow [2024-11-16 23:39:30,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=157, PETRI_TRANSITIONS=170} [2024-11-16 23:39:30,467 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -42 predicate places. [2024-11-16 23:39:30,468 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 170 transitions, 547 flow [2024-11-16 23:39:30,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-16 23:39:30,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:30,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:30,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:39:30,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1075319650, now seen corresponding path program 1 times [2024-11-16 23:39:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811886221] [2024-11-16 23:39:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:30,509 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-16 23:39:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811886221] [2024-11-16 23:39:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811886221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752867263] [2024-11-16 23:39:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:30,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 217 [2024-11-16 23:39:30,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 170 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-16 23:39:30,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:30,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 217 [2024-11-16 23:39:30,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:30,715 INFO L124 PetriNetUnfolderBase]: 291/1412 cut-off events. [2024-11-16 23:39:30,715 INFO L125 PetriNetUnfolderBase]: For 1152/1187 co-relation queries the response was YES. [2024-11-16 23:39:30,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1412 events. 291/1412 cut-off events. For 1152/1187 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9665 event pairs, 134 based on Foata normal form. 9/1343 useless extension candidates. Maximal degree in co-relation 2759. Up to 501 conditions per place. [2024-11-16 23:39:30,727 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 49 selfloop transitions, 12 changer transitions 0/185 dead transitions. [2024-11-16 23:39:30,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 185 transitions, 736 flow [2024-11-16 23:39:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2024-11-16 23:39:30,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8218125960061444 [2024-11-16 23:39:30,730 INFO L175 Difference]: Start difference. First operand has 157 places, 170 transitions, 547 flow. Second operand 3 states and 535 transitions. [2024-11-16 23:39:30,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 185 transitions, 736 flow [2024-11-16 23:39:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 185 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:30,736 INFO L231 Difference]: Finished difference. Result has 159 places, 178 transitions, 633 flow [2024-11-16 23:39:30,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=159, PETRI_TRANSITIONS=178} [2024-11-16 23:39:30,738 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -40 predicate places. [2024-11-16 23:39:30,738 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 178 transitions, 633 flow [2024-11-16 23:39:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-16 23:39:30,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:30,739 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:39:30,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-16 23:39:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2067034676, now seen corresponding path program 1 times [2024-11-16 23:39:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:30,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609428396] [2024-11-16 23:39:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:30,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:30,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:30,785 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:30,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-16 23:39:30,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-16 23:39:30,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-16 23:39:30,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-16 23:39:30,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-16 23:39:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:39:30,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:30,789 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:30,789 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:39:30,815 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:39:30,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 268 transitions, 563 flow [2024-11-16 23:39:30,893 INFO L124 PetriNetUnfolderBase]: 66/589 cut-off events. [2024-11-16 23:39:30,894 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:39:30,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 589 events. 66/589 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2243 event pairs, 1 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 398. Up to 16 conditions per place. [2024-11-16 23:39:30,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 268 transitions, 563 flow [2024-11-16 23:39:30,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 268 transitions, 563 flow [2024-11-16 23:39:30,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:30,910 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;@7b5f2ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:30,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-16 23:39:30,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:30,917 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2024-11-16 23:39:30,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:30,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:30,917 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] [2024-11-16 23:39:30,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:39:30,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1529095288, now seen corresponding path program 1 times [2024-11-16 23:39:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:30,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858453320] [2024-11-16 23:39:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:31,262 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-16 23:39:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858453320] [2024-11-16 23:39:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858453320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093708311] [2024-11-16 23:39:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:31,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 268 [2024-11-16 23:39:31,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 268 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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-16 23:39:31,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:31,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 268 [2024-11-16 23:39:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:37,813 INFO L124 PetriNetUnfolderBase]: 18812/52887 cut-off events. [2024-11-16 23:39:37,814 INFO L125 PetriNetUnfolderBase]: For 1015/1015 co-relation queries the response was YES. [2024-11-16 23:39:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79300 conditions, 52887 events. 18812/52887 cut-off events. For 1015/1015 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 660566 event pairs, 2581 based on Foata normal form. 20346/68729 useless extension candidates. Maximal degree in co-relation 9096. Up to 18109 conditions per place. [2024-11-16 23:39:38,183 INFO L140 encePairwiseOnDemand]: 238/268 looper letters, 112 selfloop transitions, 5 changer transitions 0/313 dead transitions. [2024-11-16 23:39:38,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 313 transitions, 887 flow [2024-11-16 23:39:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1396 transitions. [2024-11-16 23:39:38,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2024-11-16 23:39:38,190 INFO L175 Difference]: Start difference. First operand has 245 places, 268 transitions, 563 flow. Second operand 6 states and 1396 transitions. [2024-11-16 23:39:38,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 313 transitions, 887 flow [2024-11-16 23:39:38,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 313 transitions, 887 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:38,199 INFO L231 Difference]: Finished difference. Result has 247 places, 241 transitions, 519 flow [2024-11-16 23:39:38,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2024-11-16 23:39:38,201 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 2 predicate places. [2024-11-16 23:39:38,201 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 519 flow [2024-11-16 23:39:38,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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-16 23:39:38,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:38,203 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-16 23:39:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:39:38,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:39:38,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1367999215, now seen corresponding path program 1 times [2024-11-16 23:39:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843350144] [2024-11-16 23:39:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:38,239 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-16 23:39:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843350144] [2024-11-16 23:39:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843350144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4926110] [2024-11-16 23:39:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:38,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:38,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 268 [2024-11-16 23:39:38,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-16 23:39:38,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:38,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 268 [2024-11-16 23:39:38,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:43,073 INFO L124 PetriNetUnfolderBase]: 10334/38429 cut-off events. [2024-11-16 23:39:43,073 INFO L125 PetriNetUnfolderBase]: For 1822/1822 co-relation queries the response was YES. [2024-11-16 23:39:43,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53572 conditions, 38429 events. 10334/38429 cut-off events. For 1822/1822 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 500348 event pairs, 8306 based on Foata normal form. 1/34733 useless extension candidates. Maximal degree in co-relation 38941. Up to 14117 conditions per place. [2024-11-16 23:39:43,308 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 39 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-11-16 23:39:43,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 617 flow [2024-11-16 23:39:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-16 23:39:43,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.832089552238806 [2024-11-16 23:39:43,310 INFO L175 Difference]: Start difference. First operand has 247 places, 241 transitions, 519 flow. Second operand 3 states and 669 transitions. [2024-11-16 23:39:43,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 617 flow [2024-11-16 23:39:43,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 248 transitions, 605 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:43,318 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 521 flow [2024-11-16 23:39:43,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2024-11-16 23:39:43,319 INFO L277 CegarLoopForPetriNet]: 245 programPoint places, 0 predicate places. [2024-11-16 23:39:43,319 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 521 flow [2024-11-16 23:39:43,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-16 23:39:43,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:43,320 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] [2024-11-16 23:39:43,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:39:43,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-16 23:39:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1178763584, now seen corresponding path program 1 times [2024-11-16 23:39:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784259693] [2024-11-16 23:39:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:43,355 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-16 23:39:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784259693] [2024-11-16 23:39:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784259693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:43,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676007553] [2024-11-16 23:39:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:43,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:43,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:43,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:43,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 268 [2024-11-16 23:39:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-16 23:39:43,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:43,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 268 [2024-11-16 23:39:43,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand