./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.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_20-callback_racefree.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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:39:54,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:39:54,547 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:54,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:39:54,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:39:54,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:39:54,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:39:54,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:39:54,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:39:54,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:39:54,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:39:54,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:39:54,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:39:54,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:39:54,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:39:54,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:39:54,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:39:54,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:39:54,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:39:54,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:39:54,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:39:54,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:39:54,589 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:39:54,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:39:54,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:39:54,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:39:54,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:39:54,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:39:54,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:39:54,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:54,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:39:54,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:39:54,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:39:54,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:39:54,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:39:54,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:39:54,593 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2024-11-16 23:39:54,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:39:54,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:39:54,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:39:54,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:39:54,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:39:54,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-16 23:39:56,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:39:56,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:39:56,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-16 23:39:56,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3ab04f6/21bbb4d27f7340f68dd444d731cc8776/FLAGa469d540a [2024-11-16 23:39:56,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3ab04f6/21bbb4d27f7340f68dd444d731cc8776 [2024-11-16 23:39:56,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:39:56,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:39:56,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:56,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:39:56,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:39:56,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:56" (1/1) ... [2024-11-16 23:39:56,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74550f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:56, skipping insertion in model container [2024-11-16 23:39:56,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:56" (1/1) ... [2024-11-16 23:39:56,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:39:56,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:56,963 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:39:56,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:39:57,027 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:39:57,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:57 WrapperNode [2024-11-16 23:39:57,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:39:57,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:57,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:39:57,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:39:57,034 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:57" (1/1) ... [2024-11-16 23:39:57,045 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:57" (1/1) ... [2024-11-16 23:39:57,075 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 215 [2024-11-16 23:39:57,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:39:57,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:39:57,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:39:57,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:39:57,084 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:57" (1/1) ... [2024-11-16 23:39:57,084 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:57" (1/1) ... [2024-11-16 23:39:57,088 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:57" (1/1) ... [2024-11-16 23:39:57,088 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:57" (1/1) ... [2024-11-16 23:39:57,094 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:57" (1/1) ... [2024-11-16 23:39:57,095 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:57" (1/1) ... [2024-11-16 23:39:57,096 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:57" (1/1) ... [2024-11-16 23:39:57,097 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:57" (1/1) ... [2024-11-16 23:39:57,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:39:57,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:39:57,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:39:57,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:39:57,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:57" (1/1) ... [2024-11-16 23:39:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:39:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:39:57,137 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:57,139 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:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:39:57,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 23:39:57,177 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:39:57,177 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:39:57,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:39:57,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:39:57,179 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:57,305 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:39:57,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:39:57,521 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 23:39:57,521 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-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:57,546 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:39:57,547 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:39:57,580 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:39:57,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:39:57,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:39:57 BoogieIcfgContainer [2024-11-16 23:39:57,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:39:57,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:39:57,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:39:57,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:39:57,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:56" (1/3) ... [2024-11-16 23:39:57,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f96dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:57, skipping insertion in model container [2024-11-16 23:39:57,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:57" (2/3) ... [2024-11-16 23:39:57,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f96dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:57, skipping insertion in model container [2024-11-16 23:39:57,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:57" (3/3) ... [2024-11-16 23:39:57,589 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2024-11-16 23:39:57,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:39:57,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-16 23:39:57,603 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:39:57,654 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:39:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 237 transitions, 481 flow [2024-11-16 23:39:57,794 INFO L124 PetriNetUnfolderBase]: 27/352 cut-off events. [2024-11-16 23:39:57,794 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:39:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 352 events. 27/352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1022 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 197. Up to 6 conditions per place. [2024-11-16 23:39:57,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 237 transitions, 481 flow [2024-11-16 23:39:57,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 237 transitions, 481 flow [2024-11-16 23:39:57,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:57,824 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;@2faec549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:57,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-16 23:39:57,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:57,842 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2024-11-16 23:39:57,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:57,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:57,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:57,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:39:57,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash 678571013, now seen corresponding path program 1 times [2024-11-16 23:39:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151655892] [2024-11-16 23:39:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:58,758 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:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151655892] [2024-11-16 23:39:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151655892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:39:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842903866] [2024-11-16 23:39:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:58,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:39:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:58,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:39:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:39:58,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 237 [2024-11-16 23:39:58,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 237 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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:58,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:58,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 237 [2024-11-16 23:39:58,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:59,086 INFO L124 PetriNetUnfolderBase]: 87/807 cut-off events. [2024-11-16 23:39:59,086 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:39:59,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 807 events. 87/807 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4240 event pairs, 46 based on Foata normal form. 126/859 useless extension candidates. Maximal degree in co-relation 795. Up to 154 conditions per place. [2024-11-16 23:39:59,093 INFO L140 encePairwiseOnDemand]: 218/237 looper letters, 40 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2024-11-16 23:39:59,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 237 transitions, 571 flow [2024-11-16 23:39:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:39:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:39:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2024-11-16 23:39:59,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8670886075949367 [2024-11-16 23:39:59,112 INFO L175 Difference]: Start difference. First operand has 224 places, 237 transitions, 481 flow. Second operand 6 states and 1233 transitions. [2024-11-16 23:39:59,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 237 transitions, 571 flow [2024-11-16 23:39:59,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 237 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:39:59,129 INFO L231 Difference]: Finished difference. Result has 226 places, 221 transitions, 459 flow [2024-11-16 23:39:59,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=226, PETRI_TRANSITIONS=221} [2024-11-16 23:39:59,133 INFO L277 CegarLoopForPetriNet]: 224 programPoint places, 2 predicate places. [2024-11-16 23:39:59,135 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 221 transitions, 459 flow [2024-11-16 23:39:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 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:59,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:59,136 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, 1, 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:59,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:39:59,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:39:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash 100322408, now seen corresponding path program 1 times [2024-11-16 23:39:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:59,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39541593] [2024-11-16 23:39:59,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:59,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:59,200 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:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39541593] [2024-11-16 23:39:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39541593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:39:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718696184] [2024-11-16 23:39:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:59,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:59,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:59,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:59,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2024-11-16 23:39:59,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 221 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:59,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:59,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2024-11-16 23:39:59,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:59,345 INFO L124 PetriNetUnfolderBase]: 113/1012 cut-off events. [2024-11-16 23:39:59,345 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-11-16 23:39:59,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 1012 events. 113/1012 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5009 event pairs, 34 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 1060. Up to 137 conditions per place. [2024-11-16 23:39:59,352 INFO L140 encePairwiseOnDemand]: 228/237 looper letters, 30 selfloop transitions, 6 changer transitions 0/234 dead transitions. [2024-11-16 23:39:59,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 234 transitions, 560 flow [2024-11-16 23:39:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2024-11-16 23:39:59,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8987341772151899 [2024-11-16 23:39:59,354 INFO L175 Difference]: Start difference. First operand has 226 places, 221 transitions, 459 flow. Second operand 3 states and 639 transitions. [2024-11-16 23:39:59,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 234 transitions, 560 flow [2024-11-16 23:39:59,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 234 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:39:59,360 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 487 flow [2024-11-16 23:39:59,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2024-11-16 23:39:59,362 INFO L277 CegarLoopForPetriNet]: 224 programPoint places, -1 predicate places. [2024-11-16 23:39:59,362 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 487 flow [2024-11-16 23:39:59,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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:59,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:59,363 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, 1, 1, 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:59,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:39:59,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:39:59,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 135511060, now seen corresponding path program 1 times [2024-11-16 23:39:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563915235] [2024-11-16 23:39:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:39:59,430 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:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:39:59,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563915235] [2024-11-16 23:39:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563915235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:39:59,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:39:59,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:39:59,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903985025] [2024-11-16 23:39:59,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:39:59,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:39:59,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:39:59,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:39:59,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:39:59,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 237 [2024-11-16 23:39:59,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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:59,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:39:59,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 237 [2024-11-16 23:39:59,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:39:59,574 INFO L124 PetriNetUnfolderBase]: 86/1125 cut-off events. [2024-11-16 23:39:59,574 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:39:59,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1374 conditions, 1125 events. 86/1125 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5829 event pairs, 10 based on Foata normal form. 1/1055 useless extension candidates. Maximal degree in co-relation 1217. Up to 144 conditions per place. [2024-11-16 23:39:59,580 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 20 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-11-16 23:39:59,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 227 transitions, 539 flow [2024-11-16 23:39:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:39:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:39:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2024-11-16 23:39:59,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973277074542897 [2024-11-16 23:39:59,582 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 487 flow. Second operand 3 states and 638 transitions. [2024-11-16 23:39:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 227 transitions, 539 flow [2024-11-16 23:39:59,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 227 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:39:59,588 INFO L231 Difference]: Finished difference. Result has 224 places, 223 transitions, 483 flow [2024-11-16 23:39:59,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=224, PETRI_TRANSITIONS=223} [2024-11-16 23:39:59,589 INFO L277 CegarLoopForPetriNet]: 224 programPoint places, 0 predicate places. [2024-11-16 23:39:59,589 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 223 transitions, 483 flow [2024-11-16 23:39:59,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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:59,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:59,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:39:59,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:39:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash -860894670, now seen corresponding path program 1 times [2024-11-16 23:39:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:59,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139870180] [2024-11-16 23:39:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:59,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:39:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:39:59,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:39:59,673 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:39:59,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-16 23:39:59,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-16 23:39:59,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-16 23:39:59,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-16 23:39:59,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-16 23:39:59,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-16 23:39:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-16 23:39:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-16 23:39:59,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-16 23:39:59,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:39:59,678 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 23:39:59,680 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:39:59,680 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:39:59,706 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:39:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 270 transitions, 556 flow [2024-11-16 23:39:59,759 INFO L124 PetriNetUnfolderBase]: 45/529 cut-off events. [2024-11-16 23:39:59,759 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:39:59,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 529 events. 45/529 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1910 event pairs, 0 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 354. Up to 9 conditions per place. [2024-11-16 23:39:59,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 270 transitions, 556 flow [2024-11-16 23:39:59,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 270 transitions, 556 flow [2024-11-16 23:39:59,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:39:59,767 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;@2faec549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:39:59,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-16 23:39:59,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:39:59,774 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2024-11-16 23:39:59,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:39:59,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:39:59,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:39:59,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:39:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:39:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1983118483, now seen corresponding path program 1 times [2024-11-16 23:39:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:39:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012816521] [2024-11-16 23:39:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:39:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:39:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:00,057 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:40:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012816521] [2024-11-16 23:40:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012816521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:00,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:00,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:40:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949140453] [2024-11-16 23:40:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:00,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:40:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:40:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:00,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 270 [2024-11-16 23:40:00,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 270 transitions, 556 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:40:00,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:00,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 270 [2024-11-16 23:40:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:00,601 INFO L124 PetriNetUnfolderBase]: 1001/4826 cut-off events. [2024-11-16 23:40:00,602 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-16 23:40:00,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 4826 events. 1001/4826 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 45015 event pairs, 108 based on Foata normal form. 1222/5715 useless extension candidates. Maximal degree in co-relation 1096. Up to 1202 conditions per place. [2024-11-16 23:40:00,629 INFO L140 encePairwiseOnDemand]: 247/270 looper letters, 62 selfloop transitions, 5 changer transitions 0/280 dead transitions. [2024-11-16 23:40:00,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 280 transitions, 710 flow [2024-11-16 23:40:00,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1407 transitions. [2024-11-16 23:40:00,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8685185185185185 [2024-11-16 23:40:00,633 INFO L175 Difference]: Start difference. First operand has 254 places, 270 transitions, 556 flow. Second operand 6 states and 1407 transitions. [2024-11-16 23:40:00,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 280 transitions, 710 flow [2024-11-16 23:40:00,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 280 transitions, 710 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:00,638 INFO L231 Difference]: Finished difference. Result has 254 places, 248 transitions, 522 flow [2024-11-16 23:40:00,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=254, PETRI_TRANSITIONS=248} [2024-11-16 23:40:00,640 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, 0 predicate places. [2024-11-16 23:40:00,640 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 248 transitions, 522 flow [2024-11-16 23:40:00,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:40:00,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:00,641 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, 1, 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:40:00,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:40:00,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:40:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:00,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1490953927, now seen corresponding path program 1 times [2024-11-16 23:40:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030103098] [2024-11-16 23:40:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:00,683 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:40:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030103098] [2024-11-16 23:40:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030103098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830244562] [2024-11-16 23:40:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:00,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 270 [2024-11-16 23:40:00,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 248 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:40:00,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:00,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 270 [2024-11-16 23:40:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:01,701 INFO L124 PetriNetUnfolderBase]: 2104/9106 cut-off events. [2024-11-16 23:40:01,701 INFO L125 PetriNetUnfolderBase]: For 159/397 co-relation queries the response was YES. [2024-11-16 23:40:01,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12635 conditions, 9106 events. 2104/9106 cut-off events. For 159/397 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 90526 event pairs, 758 based on Foata normal form. 7/8258 useless extension candidates. Maximal degree in co-relation 10749. Up to 2127 conditions per place. [2024-11-16 23:40:01,748 INFO L140 encePairwiseOnDemand]: 258/270 looper letters, 45 selfloop transitions, 8 changer transitions 0/269 dead transitions. [2024-11-16 23:40:01,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 269 transitions, 681 flow [2024-11-16 23:40:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-11-16 23:40:01,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2024-11-16 23:40:01,754 INFO L175 Difference]: Start difference. First operand has 254 places, 248 transitions, 522 flow. Second operand 3 states and 714 transitions. [2024-11-16 23:40:01,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 269 transitions, 681 flow [2024-11-16 23:40:01,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 269 transitions, 671 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:40:01,760 INFO L231 Difference]: Finished difference. Result has 251 places, 252 transitions, 568 flow [2024-11-16 23:40:01,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=251, PETRI_TRANSITIONS=252} [2024-11-16 23:40:01,763 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -3 predicate places. [2024-11-16 23:40:01,764 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 252 transitions, 568 flow [2024-11-16 23:40:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:40:01,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:01,765 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, 1, 1, 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:40:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:40:01,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:40:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2092366818, now seen corresponding path program 1 times [2024-11-16 23:40:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725321309] [2024-11-16 23:40:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:01,814 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:40:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725321309] [2024-11-16 23:40:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725321309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:01,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:40:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551269071] [2024-11-16 23:40:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:01,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:01,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:01,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 270 [2024-11-16 23:40:01,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 252 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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:40:01,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:01,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 270 [2024-11-16 23:40:01,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:02,857 INFO L124 PetriNetUnfolderBase]: 1323/8148 cut-off events. [2024-11-16 23:40:02,858 INFO L125 PetriNetUnfolderBase]: For 374/438 co-relation queries the response was YES. [2024-11-16 23:40:02,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10948 conditions, 8148 events. 1323/8148 cut-off events. For 374/438 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 83161 event pairs, 934 based on Foata normal form. 1/7468 useless extension candidates. Maximal degree in co-relation 8284. Up to 1838 conditions per place. [2024-11-16 23:40:02,904 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 27 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-11-16 23:40:02,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 636 flow [2024-11-16 23:40:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-11-16 23:40:02,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2024-11-16 23:40:02,906 INFO L175 Difference]: Start difference. First operand has 251 places, 252 transitions, 568 flow. Second operand 3 states and 711 transitions. [2024-11-16 23:40:02,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 636 flow [2024-11-16 23:40:02,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:02,913 INFO L231 Difference]: Finished difference. Result has 252 places, 253 transitions, 564 flow [2024-11-16 23:40:02,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=252, PETRI_TRANSITIONS=253} [2024-11-16 23:40:02,915 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, -2 predicate places. [2024-11-16 23:40:02,915 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 253 transitions, 564 flow [2024-11-16 23:40:02,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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:40:02,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:02,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:40:02,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:40:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 308066081, now seen corresponding path program 1 times [2024-11-16 23:40:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:02,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666077132] [2024-11-16 23:40:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:03,006 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:40:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666077132] [2024-11-16 23:40:03,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666077132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:40:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454705047] [2024-11-16 23:40:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:03,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:40:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:40:03,010 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:40:03,011 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:40:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:03,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 23:40:03,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:40:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:40:03,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:40:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454705047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:40:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 23:40:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677559933] [2024-11-16 23:40:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:03,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 270 [2024-11-16 23:40:03,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 253 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:40:03,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:03,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 270 [2024-11-16 23:40:03,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:04,445 INFO L124 PetriNetUnfolderBase]: 2343/13660 cut-off events. [2024-11-16 23:40:04,446 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-16 23:40:04,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18162 conditions, 13660 events. 2343/13660 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 160310 event pairs, 1363 based on Foata normal form. 36/12554 useless extension candidates. Maximal degree in co-relation 18053. Up to 2189 conditions per place. [2024-11-16 23:40:04,508 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 37 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-16 23:40:04,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 268 transitions, 672 flow [2024-11-16 23:40:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-11-16 23:40:04,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8901234567901235 [2024-11-16 23:40:04,511 INFO L175 Difference]: Start difference. First operand has 252 places, 253 transitions, 564 flow. Second operand 3 states and 721 transitions. [2024-11-16 23:40:04,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 268 transitions, 672 flow [2024-11-16 23:40:04,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 268 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:40:04,516 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 574 flow [2024-11-16 23:40:04,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2024-11-16 23:40:04,517 INFO L277 CegarLoopForPetriNet]: 254 programPoint places, 0 predicate places. [2024-11-16 23:40:04,517 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 574 flow [2024-11-16 23:40:04,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:40:04,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:04,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:04,531 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:40:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:40:04,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-16 23:40:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2064996542, now seen corresponding path program 1 times [2024-11-16 23:40:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687668663] [2024-11-16 23:40:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:40:04,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:40:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:40:04,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:40:04,770 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-16 23:40:04,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-16 23:40:04,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-16 23:40:04,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-16 23:40:04,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-16 23:40:04,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-16 23:40:04,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:40:04,773 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 23:40:04,773 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:40:04,773 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:40:04,794 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:40:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 303 transitions, 633 flow [2024-11-16 23:40:04,873 INFO L124 PetriNetUnfolderBase]: 68/753 cut-off events. [2024-11-16 23:40:04,874 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:40:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 753 events. 68/753 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3063 event pairs, 1 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 537. Up to 16 conditions per place. [2024-11-16 23:40:04,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 303 transitions, 633 flow [2024-11-16 23:40:04,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 303 transitions, 633 flow [2024-11-16 23:40:04,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:40:04,884 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;@2faec549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:40:04,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-16 23:40:04,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:40:04,893 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2024-11-16 23:40:04,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:40:04,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:04,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:40:04,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:40:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -609247358, now seen corresponding path program 1 times [2024-11-16 23:40:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612846932] [2024-11-16 23:40:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:05,175 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:40:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612846932] [2024-11-16 23:40:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612846932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:40:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760389804] [2024-11-16 23:40:05,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:05,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:40:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:05,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:40:05,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:05,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2024-11-16 23:40:05,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 303 transitions, 633 flow. Second operand has 6 states, 6 states have (on average 238.5) internal successors, (1431), 6 states have internal predecessors, (1431), 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:40:05,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:05,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2024-11-16 23:40:05,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:08,202 INFO L124 PetriNetUnfolderBase]: 8120/28035 cut-off events. [2024-11-16 23:40:08,203 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2024-11-16 23:40:08,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39770 conditions, 28035 events. 8120/28035 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 341182 event pairs, 913 based on Foata normal form. 9171/35380 useless extension candidates. Maximal degree in co-relation 6516. Up to 8631 conditions per place. [2024-11-16 23:40:08,490 INFO L140 encePairwiseOnDemand]: 276/303 looper letters, 84 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2024-11-16 23:40:08,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 323 transitions, 851 flow [2024-11-16 23:40:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:40:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:40:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1581 transitions. [2024-11-16 23:40:08,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8696369636963697 [2024-11-16 23:40:08,495 INFO L175 Difference]: Start difference. First operand has 284 places, 303 transitions, 633 flow. Second operand 6 states and 1581 transitions. [2024-11-16 23:40:08,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 323 transitions, 851 flow [2024-11-16 23:40:08,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 323 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:40:08,499 INFO L231 Difference]: Finished difference. Result has 282 places, 275 transitions, 587 flow [2024-11-16 23:40:08,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=282, PETRI_TRANSITIONS=275} [2024-11-16 23:40:08,500 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, -2 predicate places. [2024-11-16 23:40:08,501 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 275 transitions, 587 flow [2024-11-16 23:40:08,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.5) internal successors, (1431), 6 states have internal predecessors, (1431), 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:40:08,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:08,502 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, 1, 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:40:08,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:40:08,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:40:08,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -182617466, now seen corresponding path program 1 times [2024-11-16 23:40:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564236656] [2024-11-16 23:40:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:08,532 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:40:08,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564236656] [2024-11-16 23:40:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564236656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:08,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:08,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:40:08,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977312950] [2024-11-16 23:40:08,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:08,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:08,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 303 [2024-11-16 23:40:08,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 275 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:40:08,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:08,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 303 [2024-11-16 23:40:08,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:17,742 INFO L124 PetriNetUnfolderBase]: 27273/84629 cut-off events. [2024-11-16 23:40:17,742 INFO L125 PetriNetUnfolderBase]: For 2471/5805 co-relation queries the response was YES. [2024-11-16 23:40:18,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124292 conditions, 84629 events. 27273/84629 cut-off events. For 2471/5805 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 1135454 event pairs, 10995 based on Foata normal form. 29/76499 useless extension candidates. Maximal degree in co-relation 105257. Up to 25188 conditions per place. [2024-11-16 23:40:18,251 INFO L140 encePairwiseOnDemand]: 288/303 looper letters, 60 selfloop transitions, 10 changer transitions 0/304 dead transitions. [2024-11-16 23:40:18,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 304 transitions, 806 flow [2024-11-16 23:40:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2024-11-16 23:40:18,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8679867986798679 [2024-11-16 23:40:18,256 INFO L175 Difference]: Start difference. First operand has 282 places, 275 transitions, 587 flow. Second operand 3 states and 789 transitions. [2024-11-16 23:40:18,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 304 transitions, 806 flow [2024-11-16 23:40:18,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 304 transitions, 796 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:40:18,262 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 651 flow [2024-11-16 23:40:18,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2024-11-16 23:40:18,265 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, -5 predicate places. [2024-11-16 23:40:18,265 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 651 flow [2024-11-16 23:40:18,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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:40:18,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:18,266 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, 1, 1, 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:40:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:40:18,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:40:18,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2058613391, now seen corresponding path program 1 times [2024-11-16 23:40:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303326130] [2024-11-16 23:40:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:18,302 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:40:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:18,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303326130] [2024-11-16 23:40:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303326130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:18,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:40:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:40:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139747052] [2024-11-16 23:40:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:18,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:40:18,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2024-11-16 23:40:18,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:40:18,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:18,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2024-11-16 23:40:18,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:40:26,629 INFO L124 PetriNetUnfolderBase]: 16338/71124 cut-off events. [2024-11-16 23:40:26,630 INFO L125 PetriNetUnfolderBase]: For 4025/5292 co-relation queries the response was YES. [2024-11-16 23:40:26,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100223 conditions, 71124 events. 16338/71124 cut-off events. For 4025/5292 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 1033127 event pairs, 12212 based on Foata normal form. 1/64629 useless extension candidates. Maximal degree in co-relation 76389. Up to 19482 conditions per place. [2024-11-16 23:40:27,083 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 33 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-16 23:40:27,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 286 transitions, 731 flow [2024-11-16 23:40:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:40:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:40:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2024-11-16 23:40:27,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8613861386138614 [2024-11-16 23:40:27,085 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 651 flow. Second operand 3 states and 783 transitions. [2024-11-16 23:40:27,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 286 transitions, 731 flow [2024-11-16 23:40:27,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 286 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:40:27,108 INFO L231 Difference]: Finished difference. Result has 280 places, 282 transitions, 643 flow [2024-11-16 23:40:27,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=280, PETRI_TRANSITIONS=282} [2024-11-16 23:40:27,109 INFO L277 CegarLoopForPetriNet]: 284 programPoint places, -4 predicate places. [2024-11-16 23:40:27,109 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 282 transitions, 643 flow [2024-11-16 23:40:27,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:40:27,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:40:27,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:40:27,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-16 23:40:27,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:40:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2024553696, now seen corresponding path program 1 times [2024-11-16 23:40:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:40:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317813648] [2024-11-16 23:40:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:40:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:27,167 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:40:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:40:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317813648] [2024-11-16 23:40:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317813648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:40:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425698552] [2024-11-16 23:40:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:40:27,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:40:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:40:27,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:40:27,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 23:40:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:40:27,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 23:40:27,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:40:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:40:27,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:40:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425698552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:40:27,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:40:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-16 23:40:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312995646] [2024-11-16 23:40:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:40:27,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:40:27,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:40:27,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:40:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:40:27,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 303 [2024-11-16 23:40:27,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 282 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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:40:27,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:40:27,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 303 [2024-11-16 23:40:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand