./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.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/pthread-race-challenges/thread-join-array-const-race-2.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 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:50:27,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:50:27,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:50:27,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:50:27,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:50:27,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:50:27,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:50:27,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:50:27,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:50:27,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:50:27,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:50:27,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:50:27,636 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:50:27,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:50:27,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:50:27,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:50:27,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:50:27,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:50:27,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:50:27,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:50:27,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:50:27,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:50:27,643 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:50:27,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:50:27,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:50:27,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:50:27,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:50:27,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:50:27,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:50:27,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:50:27,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:50:27,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:50:27,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:50:27,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:50:27,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:50:27,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:50:27,647 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 -> 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d [2024-11-16 23:50:27,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:50:27,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:50:27,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:50:27,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:50:27,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:50:27,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2024-11-16 23:50:29,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:50:29,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:50:29,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2024-11-16 23:50:29,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb505e3e0/8b58e6fb51a441b2a2b3698489ccd1ff/FLAGf4ed5aab4 [2024-11-16 23:50:29,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb505e3e0/8b58e6fb51a441b2a2b3698489ccd1ff [2024-11-16 23:50:29,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:50:29,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:50:29,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:50:29,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:50:29,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:50:29,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:29" (1/1) ... [2024-11-16 23:50:29,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ffaff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:29, skipping insertion in model container [2024-11-16 23:50:29,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:50:29" (1/1) ... [2024-11-16 23:50:29,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:50:30,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:50:30,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:50:30,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:50:30,127 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:50:30,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30 WrapperNode [2024-11-16 23:50:30,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:50:30,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:50:30,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:50:30,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:50:30,137 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:50:30" (1/1) ... [2024-11-16 23:50:30,151 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:50:30" (1/1) ... [2024-11-16 23:50:30,174 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-16 23:50:30,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:50:30,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:50:30,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:50:30,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:50:30,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:50:30,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:50:30,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:50:30,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:50:30,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (1/1) ... [2024-11-16 23:50:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:50:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:50:30,260 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:50:30,263 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:50:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:50:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:50:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:50:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:50:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:50:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:50:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:50:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-16 23:50:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-16 23:50:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:50:30,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:50:30,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:50:30,349 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:50:30,561 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:50:30,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:50:30,705 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2024-11-16 23:50:30,706 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2024-11-16 23:50:30,733 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:50:30,733 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:50:30,757 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:50:30,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:50:30,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:50:30 BoogieIcfgContainer [2024-11-16 23:50:30,758 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:50:30,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:50:30,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:50:30,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:50:30,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:50:29" (1/3) ... [2024-11-16 23:50:30,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680ea267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:30, skipping insertion in model container [2024-11-16 23:50:30,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:50:30" (2/3) ... [2024-11-16 23:50:30,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680ea267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:50:30, skipping insertion in model container [2024-11-16 23:50:30,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:50:30" (3/3) ... [2024-11-16 23:50:30,767 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2024-11-16 23:50:30,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:50:30,783 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-16 23:50:30,783 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:50:30,824 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 23:50:30,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 165 flow [2024-11-16 23:50:30,905 INFO L124 PetriNetUnfolderBase]: 5/116 cut-off events. [2024-11-16 23:50:30,906 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:50:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 5/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2024-11-16 23:50:30,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 165 flow [2024-11-16 23:50:30,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 79 transitions, 165 flow [2024-11-16 23:50:30,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:50:30,929 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;@4ccb0693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:50:30,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 23:50:30,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:50:30,937 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:50:30,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:50:30,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:30,938 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] [2024-11-16 23:50:30,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 47149494, now seen corresponding path program 1 times [2024-11-16 23:50:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770522153] [2024-11-16 23:50:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:31,174 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:50:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770522153] [2024-11-16 23:50:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770522153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:31,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685037284] [2024-11-16 23:50:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:50:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:50:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:50:31,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 79 [2024-11-16 23:50:31,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 165 flow. Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 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:50:31,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:31,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 79 [2024-11-16 23:50:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:31,281 INFO L124 PetriNetUnfolderBase]: 1/112 cut-off events. [2024-11-16 23:50:31,281 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-16 23:50:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 1/112 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs, 0 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 2. Up to 5 conditions per place. [2024-11-16 23:50:31,283 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 4 selfloop transitions, 0 changer transitions 0/77 dead transitions. [2024-11-16 23:50:31,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 169 flow [2024-11-16 23:50:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:50:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:50:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2024-11-16 23:50:31,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9620253164556962 [2024-11-16 23:50:31,300 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 165 flow. Second operand 2 states and 152 transitions. [2024-11-16 23:50:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 169 flow [2024-11-16 23:50:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 169 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:31,313 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 161 flow [2024-11-16 23:50:31,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=161, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-11-16 23:50:31,320 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2024-11-16 23:50:31,321 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 161 flow [2024-11-16 23:50:31,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 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:50:31,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:31,322 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] [2024-11-16 23:50:31,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:50:31,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1458448492, now seen corresponding path program 1 times [2024-11-16 23:50:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455411075] [2024-11-16 23:50:31,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:31,492 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:50:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:31,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455411075] [2024-11-16 23:50:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455411075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129672293] [2024-11-16 23:50:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:31,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-16 23:50:31,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:50:31,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:31,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-16 23:50:31,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:31,643 INFO L124 PetriNetUnfolderBase]: 8/182 cut-off events. [2024-11-16 23:50:31,644 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:50:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 182 events. 8/182 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 549 event pairs, 2 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 213. Up to 17 conditions per place. [2024-11-16 23:50:31,645 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2024-11-16 23:50:31,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 199 flow [2024-11-16 23:50:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2024-11-16 23:50:31,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2024-11-16 23:50:31,650 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 161 flow. Second operand 4 states and 280 transitions. [2024-11-16 23:50:31,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 199 flow [2024-11-16 23:50:31,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:31,654 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 173 flow [2024-11-16 23:50:31,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2024-11-16 23:50:31,655 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2024-11-16 23:50:31,656 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 173 flow [2024-11-16 23:50:31,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:50:31,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:31,657 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] [2024-11-16 23:50:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:50:31,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1549016186, now seen corresponding path program 1 times [2024-11-16 23:50:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:31,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037384837] [2024-11-16 23:50:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:32,227 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:50:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037384837] [2024-11-16 23:50:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037384837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:50:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422661789] [2024-11-16 23:50:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:32,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:50:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:50:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:50:32,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 79 [2024-11-16 23:50:32,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:50:32,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:32,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 79 [2024-11-16 23:50:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:32,468 INFO L124 PetriNetUnfolderBase]: 30/218 cut-off events. [2024-11-16 23:50:32,469 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-16 23:50:32,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 218 events. 30/218 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 889 event pairs, 11 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 330. Up to 62 conditions per place. [2024-11-16 23:50:32,471 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-11-16 23:50:32,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 247 flow [2024-11-16 23:50:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:50:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:50:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2024-11-16 23:50:32,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7489451476793249 [2024-11-16 23:50:32,475 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2024-11-16 23:50:32,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 247 flow [2024-11-16 23:50:32,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 23:50:32,482 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 173 flow [2024-11-16 23:50:32,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-11-16 23:50:32,483 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-16 23:50:32,485 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 173 flow [2024-11-16 23:50:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:50:32,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:32,486 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] [2024-11-16 23:50:32,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:50:32,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash -134464211, now seen corresponding path program 1 times [2024-11-16 23:50:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446981913] [2024-11-16 23:50:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:32,540 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:50:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446981913] [2024-11-16 23:50:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446981913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390440880] [2024-11-16 23:50:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:32,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2024-11-16 23:50:32,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:50:32,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:32,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2024-11-16 23:50:32,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:32,578 INFO L124 PetriNetUnfolderBase]: 6/145 cut-off events. [2024-11-16 23:50:32,579 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2024-11-16 23:50:32,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 145 events. 6/145 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 376 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 184. Up to 21 conditions per place. [2024-11-16 23:50:32,580 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-16 23:50:32,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 79 transitions, 205 flow [2024-11-16 23:50:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2024-11-16 23:50:32,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071729957805907 [2024-11-16 23:50:32,581 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2024-11-16 23:50:32,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 79 transitions, 205 flow [2024-11-16 23:50:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:50:32,583 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 193 flow [2024-11-16 23:50:32,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-11-16 23:50:32,584 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2024-11-16 23:50:32,585 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 193 flow [2024-11-16 23:50:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:50:32,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:32,585 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] [2024-11-16 23:50:32,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:50:32,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash 60735091, now seen corresponding path program 1 times [2024-11-16 23:50:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:32,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287456637] [2024-11-16 23:50:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:32,694 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:50:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287456637] [2024-11-16 23:50:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287456637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:32,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:32,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799401365] [2024-11-16 23:50:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:32,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:32,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:32,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:32,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-16 23:50:32,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:50:32,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:32,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-16 23:50:32,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:32,769 INFO L124 PetriNetUnfolderBase]: 2/117 cut-off events. [2024-11-16 23:50:32,770 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:50:32,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 117 events. 2/117 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 3/114 useless extension candidates. Maximal degree in co-relation 143. Up to 7 conditions per place. [2024-11-16 23:50:32,772 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2024-11-16 23:50:32,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 203 flow [2024-11-16 23:50:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2024-11-16 23:50:32,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.879746835443038 [2024-11-16 23:50:32,774 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2024-11-16 23:50:32,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 203 flow [2024-11-16 23:50:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-16 23:50:32,778 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 157 flow [2024-11-16 23:50:32,778 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-11-16 23:50:32,780 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2024-11-16 23:50:32,780 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 157 flow [2024-11-16 23:50:32,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:50:32,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:32,781 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] [2024-11-16 23:50:32,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:50:32,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-16 23:50:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1202867191, now seen corresponding path program 1 times [2024-11-16 23:50:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091739256] [2024-11-16 23:50:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:32,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:50:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:32,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:50:32,858 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:50:32,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-16 23:50:32,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-16 23:50:32,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-16 23:50:32,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-16 23:50:32,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-16 23:50:32,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-16 23:50:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:50:32,861 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 23:50:32,864 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:50:32,864 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:50:32,889 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:50:32,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 97 transitions, 210 flow [2024-11-16 23:50:32,920 INFO L124 PetriNetUnfolderBase]: 10/204 cut-off events. [2024-11-16 23:50:32,920 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:50:32,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 204 events. 10/204 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 467 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 118. Up to 8 conditions per place. [2024-11-16 23:50:32,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 97 transitions, 210 flow [2024-11-16 23:50:32,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 97 transitions, 210 flow [2024-11-16 23:50:32,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:50:32,924 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;@4ccb0693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:50:32,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-16 23:50:32,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:50:32,928 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:50:32,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:50:32,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:32,929 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] [2024-11-16 23:50:32,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 492748566, now seen corresponding path program 1 times [2024-11-16 23:50:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339089319] [2024-11-16 23:50:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:32,946 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:50:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339089319] [2024-11-16 23:50:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339089319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914685376] [2024-11-16 23:50:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:32,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:50:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:50:32,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:50:32,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 97 [2024-11-16 23:50:32,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 210 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:50:32,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:32,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 97 [2024-11-16 23:50:32,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:33,000 INFO L124 PetriNetUnfolderBase]: 13/313 cut-off events. [2024-11-16 23:50:33,001 INFO L125 PetriNetUnfolderBase]: For 35/57 co-relation queries the response was YES. [2024-11-16 23:50:33,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 313 events. 13/313 cut-off events. For 35/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1080 event pairs, 10 based on Foata normal form. 21/299 useless extension candidates. Maximal degree in co-relation 198. Up to 31 conditions per place. [2024-11-16 23:50:33,004 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 8 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2024-11-16 23:50:33,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 222 flow [2024-11-16 23:50:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:50:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:50:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-16 23:50:33,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9484536082474226 [2024-11-16 23:50:33,007 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 210 flow. Second operand 2 states and 184 transitions. [2024-11-16 23:50:33,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 222 flow [2024-11-16 23:50:33,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:33,010 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 206 flow [2024-11-16 23:50:33,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=206, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-11-16 23:50:33,011 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2024-11-16 23:50:33,011 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 206 flow [2024-11-16 23:50:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:50:33,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:33,012 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] [2024-11-16 23:50:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:50:33,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:33,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash 182430188, now seen corresponding path program 1 times [2024-11-16 23:50:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034652432] [2024-11-16 23:50:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:33,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:50:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034652432] [2024-11-16 23:50:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034652432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834794479] [2024-11-16 23:50:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:33,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-16 23:50:33,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:50:33,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:33,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-16 23:50:33,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:33,204 INFO L124 PetriNetUnfolderBase]: 72/626 cut-off events. [2024-11-16 23:50:33,204 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-16 23:50:33,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 626 events. 72/626 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3775 event pairs, 20 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 788. Up to 106 conditions per place. [2024-11-16 23:50:33,207 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-11-16 23:50:33,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 264 flow [2024-11-16 23:50:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-16 23:50:33,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.884020618556701 [2024-11-16 23:50:33,209 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 206 flow. Second operand 4 states and 343 transitions. [2024-11-16 23:50:33,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 264 flow [2024-11-16 23:50:33,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:33,212 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 222 flow [2024-11-16 23:50:33,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-11-16 23:50:33,213 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2024-11-16 23:50:33,213 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 222 flow [2024-11-16 23:50:33,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:50:33,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:33,214 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] [2024-11-16 23:50:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:50:33,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -638891494, now seen corresponding path program 1 times [2024-11-16 23:50:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874494597] [2024-11-16 23:50:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:33,499 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:50:33,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874494597] [2024-11-16 23:50:33,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874494597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:33,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:33,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:50:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181564689] [2024-11-16 23:50:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:33,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:50:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:33,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:50:33,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:50:33,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2024-11-16 23:50:33,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:50:33,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:33,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2024-11-16 23:50:33,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:33,793 INFO L124 PetriNetUnfolderBase]: 236/981 cut-off events. [2024-11-16 23:50:33,794 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-16 23:50:33,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 981 events. 236/981 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6966 event pairs, 34 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1510. Up to 313 conditions per place. [2024-11-16 23:50:33,801 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2024-11-16 23:50:33,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 338 flow [2024-11-16 23:50:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:50:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:50:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2024-11-16 23:50:33,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7749140893470791 [2024-11-16 23:50:33,803 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2024-11-16 23:50:33,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 338 flow [2024-11-16 23:50:33,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:33,806 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 224 flow [2024-11-16 23:50:33,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-11-16 23:50:33,807 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2024-11-16 23:50:33,807 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 224 flow [2024-11-16 23:50:33,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:50:33,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:33,808 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:50:33,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:50:33,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:33,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash -64954019, now seen corresponding path program 1 times [2024-11-16 23:50:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802087157] [2024-11-16 23:50:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:33,843 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:50:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802087157] [2024-11-16 23:50:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802087157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928548682] [2024-11-16 23:50:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:33,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:33,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-16 23:50:33,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:50:33,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:33,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-16 23:50:33,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:33,968 INFO L124 PetriNetUnfolderBase]: 116/720 cut-off events. [2024-11-16 23:50:33,968 INFO L125 PetriNetUnfolderBase]: For 95/159 co-relation queries the response was YES. [2024-11-16 23:50:33,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 720 events. 116/720 cut-off events. For 95/159 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4591 event pairs, 58 based on Foata normal form. 4/627 useless extension candidates. Maximal degree in co-relation 1012. Up to 185 conditions per place. [2024-11-16 23:50:33,973 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2024-11-16 23:50:33,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 294 flow [2024-11-16 23:50:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-16 23:50:33,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2024-11-16 23:50:33,975 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2024-11-16 23:50:33,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 294 flow [2024-11-16 23:50:33,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:50:33,979 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 252 flow [2024-11-16 23:50:33,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-16 23:50:33,980 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2024-11-16 23:50:33,980 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 252 flow [2024-11-16 23:50:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:50:33,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:33,980 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] [2024-11-16 23:50:33,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:50:33,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:33,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1894648579, now seen corresponding path program 1 times [2024-11-16 23:50:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331220934] [2024-11-16 23:50:33,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:34,050 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:50:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331220934] [2024-11-16 23:50:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331220934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240543254] [2024-11-16 23:50:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:34,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:34,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-16 23:50:34,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:50:34,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:34,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-16 23:50:34,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:34,192 INFO L124 PetriNetUnfolderBase]: 63/607 cut-off events. [2024-11-16 23:50:34,192 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-16 23:50:34,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 607 events. 63/607 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3375 event pairs, 24 based on Foata normal form. 15/571 useless extension candidates. Maximal degree in co-relation 830. Up to 72 conditions per place. [2024-11-16 23:50:34,196 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 19 selfloop transitions, 4 changer transitions 3/110 dead transitions. [2024-11-16 23:50:34,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 332 flow [2024-11-16 23:50:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2024-11-16 23:50:34,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943298969072165 [2024-11-16 23:50:34,198 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2024-11-16 23:50:34,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 332 flow [2024-11-16 23:50:34,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:34,201 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 258 flow [2024-11-16 23:50:34,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2024-11-16 23:50:34,202 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-11-16 23:50:34,203 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 258 flow [2024-11-16 23:50:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:50:34,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:34,203 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] [2024-11-16 23:50:34,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:50:34,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:34,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -249923928, now seen corresponding path program 1 times [2024-11-16 23:50:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158025145] [2024-11-16 23:50:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:34,312 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:50:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158025145] [2024-11-16 23:50:34,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158025145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:50:34,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699068677] [2024-11-16 23:50:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:34,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:50:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:50:34,314 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:50:34,316 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:50:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:34,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:50:34,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:50:34,556 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:50:34,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:50:34,640 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:50:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699068677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:50:34,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:50:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-16 23:50:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980490705] [2024-11-16 23:50:34,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:50:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 23:50:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 23:50:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 23:50:34,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2024-11-16 23:50:34,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 258 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 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:50:34,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:34,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2024-11-16 23:50:34,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:34,911 INFO L124 PetriNetUnfolderBase]: 81/467 cut-off events. [2024-11-16 23:50:34,912 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-16 23:50:34,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 467 events. 81/467 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2474 event pairs, 1 based on Foata normal form. 15/460 useless extension candidates. Maximal degree in co-relation 666. Up to 56 conditions per place. [2024-11-16 23:50:34,915 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 28 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-16 23:50:34,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 292 flow [2024-11-16 23:50:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:50:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:50:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 808 transitions. [2024-11-16 23:50:34,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2024-11-16 23:50:34,918 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 258 flow. Second operand 10 states and 808 transitions. [2024-11-16 23:50:34,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 292 flow [2024-11-16 23:50:34,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:50:34,920 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 195 flow [2024-11-16 23:50:34,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=195, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-11-16 23:50:34,921 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-11-16 23:50:34,921 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 195 flow [2024-11-16 23:50:34,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 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:50:34,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:34,922 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] [2024-11-16 23:50:34,941 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:50:35,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 23:50:35,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -240598749, now seen corresponding path program 1 times [2024-11-16 23:50:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388093948] [2024-11-16 23:50:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388093948] [2024-11-16 23:50:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388093948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991095650] [2024-11-16 23:50:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:35,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-16 23:50:35,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:50:35,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:35,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-16 23:50:35,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:35,229 INFO L124 PetriNetUnfolderBase]: 27/232 cut-off events. [2024-11-16 23:50:35,230 INFO L125 PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES. [2024-11-16 23:50:35,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 232 events. 27/232 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 829 event pairs, 16 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 363. Up to 55 conditions per place. [2024-11-16 23:50:35,232 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 13 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-16 23:50:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 78 transitions, 243 flow [2024-11-16 23:50:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-16 23:50:35,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2024-11-16 23:50:35,233 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 195 flow. Second operand 3 states and 258 transitions. [2024-11-16 23:50:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 78 transitions, 243 flow [2024-11-16 23:50:35,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 226 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-16 23:50:35,235 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 214 flow [2024-11-16 23:50:35,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2024-11-16 23:50:35,237 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -12 predicate places. [2024-11-16 23:50:35,237 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 214 flow [2024-11-16 23:50:35,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:50:35,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:35,237 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] [2024-11-16 23:50:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:50:35,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1033364713, now seen corresponding path program 1 times [2024-11-16 23:50:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813213450] [2024-11-16 23:50:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813213450] [2024-11-16 23:50:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813213450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:50:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095175911] [2024-11-16 23:50:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:35,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97 [2024-11-16 23:50:35,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:50:35,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:35,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97 [2024-11-16 23:50:35,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:35,400 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2024-11-16 23:50:35,400 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-16 23:50:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 144 events. 3/144 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 273 event pairs, 0 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 195. Up to 10 conditions per place. [2024-11-16 23:50:35,401 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 4 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-16 23:50:35,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 69 transitions, 195 flow [2024-11-16 23:50:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-11-16 23:50:35,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9209621993127147 [2024-11-16 23:50:35,403 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 214 flow. Second operand 3 states and 268 transitions. [2024-11-16 23:50:35,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 69 transitions, 195 flow [2024-11-16 23:50:35,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 69 transitions, 175 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-16 23:50:35,405 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 160 flow [2024-11-16 23:50:35,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-11-16 23:50:35,406 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -18 predicate places. [2024-11-16 23:50:35,406 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 160 flow [2024-11-16 23:50:35,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:50:35,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:35,407 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:50:35,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:50:35,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-16 23:50:35,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:35,408 INFO L85 PathProgramCache]: Analyzing trace with hash -454503742, now seen corresponding path program 1 times [2024-11-16 23:50:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:35,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777094231] [2024-11-16 23:50:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:35,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:50:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:35,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:50:35,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:50:35,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-16 23:50:35,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-16 23:50:35,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-16 23:50:35,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-16 23:50:35,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-16 23:50:35,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-16 23:50:35,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-16 23:50:35,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:50:35,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:50:35,464 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:50:35,464 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:50:35,491 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:50:35,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 257 flow [2024-11-16 23:50:35,526 INFO L124 PetriNetUnfolderBase]: 20/343 cut-off events. [2024-11-16 23:50:35,527 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 23:50:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 343 events. 20/343 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 969 event pairs, 1 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 212. Up to 16 conditions per place. [2024-11-16 23:50:35,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 257 flow [2024-11-16 23:50:35,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 257 flow [2024-11-16 23:50:35,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:50:35,536 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;@4ccb0693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:50:35,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-16 23:50:35,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:50:35,539 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:50:35,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:50:35,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:35,540 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] [2024-11-16 23:50:35,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:35,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1685206326, now seen corresponding path program 1 times [2024-11-16 23:50:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044312648] [2024-11-16 23:50:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:35,554 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:50:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044312648] [2024-11-16 23:50:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044312648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:35,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:35,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140441872] [2024-11-16 23:50:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:35,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:50:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:50:35,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:50:35,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2024-11-16 23:50:35,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 257 flow. Second operand has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 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:50:35,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:35,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2024-11-16 23:50:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:35,689 INFO L124 PetriNetUnfolderBase]: 98/1088 cut-off events. [2024-11-16 23:50:35,689 INFO L125 PetriNetUnfolderBase]: For 211/342 co-relation queries the response was YES. [2024-11-16 23:50:35,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1088 events. 98/1088 cut-off events. For 211/342 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7075 event pairs, 87 based on Foata normal form. 80/1039 useless extension candidates. Maximal degree in co-relation 814. Up to 172 conditions per place. [2024-11-16 23:50:35,699 INFO L140 encePairwiseOnDemand]: 113/115 looper letters, 12 selfloop transitions, 0 changer transitions 0/113 dead transitions. [2024-11-16 23:50:35,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 277 flow [2024-11-16 23:50:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:50:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:50:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2024-11-16 23:50:35,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2024-11-16 23:50:35,701 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 257 flow. Second operand 2 states and 216 transitions. [2024-11-16 23:50:35,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 277 flow [2024-11-16 23:50:35,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:35,703 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 253 flow [2024-11-16 23:50:35,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=253, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2024-11-16 23:50:35,704 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-16 23:50:35,704 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 253 flow [2024-11-16 23:50:35,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 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:50:35,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:35,705 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] [2024-11-16 23:50:35,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:50:35,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -621926804, now seen corresponding path program 1 times [2024-11-16 23:50:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968949444] [2024-11-16 23:50:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:35,740 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:50:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968949444] [2024-11-16 23:50:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968949444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:35,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:35,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867039884] [2024-11-16 23:50:35,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:35,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:35,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:35,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-16 23:50:35,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:50:35,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:35,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-16 23:50:35,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:36,049 INFO L124 PetriNetUnfolderBase]: 413/2207 cut-off events. [2024-11-16 23:50:36,049 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-11-16 23:50:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 2207 events. 413/2207 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17551 event pairs, 232 based on Foata normal form. 1/2019 useless extension candidates. Maximal degree in co-relation 2976. Up to 496 conditions per place. [2024-11-16 23:50:36,066 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2024-11-16 23:50:36,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 327 flow [2024-11-16 23:50:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2024-11-16 23:50:36,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2024-11-16 23:50:36,068 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 253 flow. Second operand 4 states and 405 transitions. [2024-11-16 23:50:36,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 327 flow [2024-11-16 23:50:36,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:36,071 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 269 flow [2024-11-16 23:50:36,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-11-16 23:50:36,072 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2024-11-16 23:50:36,072 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 269 flow [2024-11-16 23:50:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:50:36,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:36,072 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] [2024-11-16 23:50:36,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:50:36,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash -531843846, now seen corresponding path program 1 times [2024-11-16 23:50:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267648770] [2024-11-16 23:50:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:36,246 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:50:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267648770] [2024-11-16 23:50:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267648770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:50:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555118204] [2024-11-16 23:50:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:36,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:50:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:50:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:50:36,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2024-11-16 23:50:36,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:50:36,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:36,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2024-11-16 23:50:36,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:36,867 INFO L124 PetriNetUnfolderBase]: 1295/4022 cut-off events. [2024-11-16 23:50:36,867 INFO L125 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2024-11-16 23:50:36,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6375 conditions, 4022 events. 1295/4022 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 35602 event pairs, 181 based on Foata normal form. 0/3745 useless extension candidates. Maximal degree in co-relation 6367. Up to 1483 conditions per place. [2024-11-16 23:50:36,897 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-11-16 23:50:36,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 137 transitions, 425 flow [2024-11-16 23:50:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:50:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:50:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2024-11-16 23:50:36,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927536231884058 [2024-11-16 23:50:36,900 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2024-11-16 23:50:36,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 137 transitions, 425 flow [2024-11-16 23:50:36,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:36,904 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 271 flow [2024-11-16 23:50:36,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-11-16 23:50:36,905 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2024-11-16 23:50:36,905 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 271 flow [2024-11-16 23:50:36,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:50:36,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:36,905 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] [2024-11-16 23:50:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:50:36,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1710788141, now seen corresponding path program 1 times [2024-11-16 23:50:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:36,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279261561] [2024-11-16 23:50:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:36,931 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:50:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279261561] [2024-11-16 23:50:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279261561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:36,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443400797] [2024-11-16 23:50:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:36,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:36,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-16 23:50:36,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:50:36,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:36,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-16 23:50:36,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:37,479 INFO L124 PetriNetUnfolderBase]: 1023/4148 cut-off events. [2024-11-16 23:50:37,479 INFO L125 PetriNetUnfolderBase]: For 867/1327 co-relation queries the response was YES. [2024-11-16 23:50:37,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6121 conditions, 4148 events. 1023/4148 cut-off events. For 867/1327 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 39807 event pairs, 572 based on Foata normal form. 9/3607 useless extension candidates. Maximal degree in co-relation 6113. Up to 1329 conditions per place. [2024-11-16 23:50:37,507 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2024-11-16 23:50:37,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 381 flow [2024-11-16 23:50:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2024-11-16 23:50:37,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072463768115943 [2024-11-16 23:50:37,510 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2024-11-16 23:50:37,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 381 flow [2024-11-16 23:50:37,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:50:37,512 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 307 flow [2024-11-16 23:50:37,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2024-11-16 23:50:37,513 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2024-11-16 23:50:37,513 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 307 flow [2024-11-16 23:50:37,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:50:37,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:37,514 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] [2024-11-16 23:50:37,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:50:37,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:37,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -835623213, now seen corresponding path program 1 times [2024-11-16 23:50:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:37,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480721827] [2024-11-16 23:50:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:37,563 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:50:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480721827] [2024-11-16 23:50:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480721827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:37,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:37,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:37,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62533625] [2024-11-16 23:50:37,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:37,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:37,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:37,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-16 23:50:37,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:50:37,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:37,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-16 23:50:37,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:38,109 INFO L124 PetriNetUnfolderBase]: 666/3354 cut-off events. [2024-11-16 23:50:38,109 INFO L125 PetriNetUnfolderBase]: For 434/438 co-relation queries the response was YES. [2024-11-16 23:50:38,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 3354 events. 666/3354 cut-off events. For 434/438 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 30914 event pairs, 320 based on Foata normal form. 63/3060 useless extension candidates. Maximal degree in co-relation 4907. Up to 536 conditions per place. [2024-11-16 23:50:38,138 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-11-16 23:50:38,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 418 flow [2024-11-16 23:50:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2024-11-16 23:50:38,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2024-11-16 23:50:38,140 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2024-11-16 23:50:38,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 418 flow [2024-11-16 23:50:38,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:38,144 INFO L231 Difference]: Finished difference. Result has 125 places, 119 transitions, 311 flow [2024-11-16 23:50:38,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=125, PETRI_TRANSITIONS=119} [2024-11-16 23:50:38,145 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-11-16 23:50:38,145 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 119 transitions, 311 flow [2024-11-16 23:50:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:50:38,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:38,146 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] [2024-11-16 23:50:38,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:50:38,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash 313886443, now seen corresponding path program 1 times [2024-11-16 23:50:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:38,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372887414] [2024-11-16 23:50:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:38,241 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:50:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372887414] [2024-11-16 23:50:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372887414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:50:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880316844] [2024-11-16 23:50:38,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:38,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:50:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:50:38,244 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:50:38,246 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:50:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:38,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:50:38,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:50:38,438 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:50:38,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:50:38,508 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:50:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880316844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:50:38,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:50:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-16 23:50:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392925599] [2024-11-16 23:50:38,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:50:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 23:50:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 23:50:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 23:50:38,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2024-11-16 23:50:38,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 119 transitions, 311 flow. Second operand has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 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:50:38,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:38,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2024-11-16 23:50:38,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:39,366 INFO L124 PetriNetUnfolderBase]: 1016/4740 cut-off events. [2024-11-16 23:50:39,367 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2024-11-16 23:50:39,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 4740 events. 1016/4740 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 45691 event pairs, 151 based on Foata normal form. 15/4199 useless extension candidates. Maximal degree in co-relation 7002. Up to 749 conditions per place. [2024-11-16 23:50:39,398 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 50 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2024-11-16 23:50:39,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 157 transitions, 511 flow [2024-11-16 23:50:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:50:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:50:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2024-11-16 23:50:39,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8460869565217392 [2024-11-16 23:50:39,401 INFO L175 Difference]: Start difference. First operand has 125 places, 119 transitions, 311 flow. Second operand 10 states and 973 transitions. [2024-11-16 23:50:39,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 157 transitions, 511 flow [2024-11-16 23:50:39,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 157 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:39,407 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 361 flow [2024-11-16 23:50:39,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-11-16 23:50:39,408 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2024-11-16 23:50:39,408 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 361 flow [2024-11-16 23:50:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 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:50:39,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:39,409 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] [2024-11-16 23:50:39,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 23:50:39,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-16 23:50:39,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 208200995, now seen corresponding path program 1 times [2024-11-16 23:50:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226670685] [2024-11-16 23:50:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226670685] [2024-11-16 23:50:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226670685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664330184] [2024-11-16 23:50:39,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:39,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:39,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:39,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-16 23:50:39,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:50:39,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:39,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-16 23:50:39,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:40,147 INFO L124 PetriNetUnfolderBase]: 902/4284 cut-off events. [2024-11-16 23:50:40,147 INFO L125 PetriNetUnfolderBase]: For 1483/2035 co-relation queries the response was YES. [2024-11-16 23:50:40,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 4284 events. 902/4284 cut-off events. For 1483/2035 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 41411 event pairs, 487 based on Foata normal form. 17/3833 useless extension candidates. Maximal degree in co-relation 7054. Up to 1159 conditions per place. [2024-11-16 23:50:40,185 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 28 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2024-11-16 23:50:40,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 486 flow [2024-11-16 23:50:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2024-11-16 23:50:40,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043478260869565 [2024-11-16 23:50:40,187 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 361 flow. Second operand 3 states and 312 transitions. [2024-11-16 23:50:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 486 flow [2024-11-16 23:50:40,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 478 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:40,191 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 429 flow [2024-11-16 23:50:40,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2024-11-16 23:50:40,192 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2024-11-16 23:50:40,192 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 429 flow [2024-11-16 23:50:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:50:40,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:40,192 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] [2024-11-16 23:50:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:50:40,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -667551561, now seen corresponding path program 1 times [2024-11-16 23:50:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037356699] [2024-11-16 23:50:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037356699] [2024-11-16 23:50:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037356699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:50:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691118484] [2024-11-16 23:50:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:40,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2024-11-16 23:50:40,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:50:40,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:40,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2024-11-16 23:50:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:40,494 INFO L124 PetriNetUnfolderBase]: 98/1362 cut-off events. [2024-11-16 23:50:40,494 INFO L125 PetriNetUnfolderBase]: For 340/384 co-relation queries the response was YES. [2024-11-16 23:50:40,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1362 events. 98/1362 cut-off events. For 340/384 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10069 event pairs, 26 based on Foata normal form. 20/1271 useless extension candidates. Maximal degree in co-relation 2019. Up to 101 conditions per place. [2024-11-16 23:50:40,503 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2024-11-16 23:50:40,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 131 transitions, 450 flow [2024-11-16 23:50:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2024-11-16 23:50:40,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304347826086956 [2024-11-16 23:50:40,505 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 429 flow. Second operand 3 states and 321 transitions. [2024-11-16 23:50:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 131 transitions, 450 flow [2024-11-16 23:50:40,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 438 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:40,510 INFO L231 Difference]: Finished difference. Result has 137 places, 126 transitions, 383 flow [2024-11-16 23:50:40,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2024-11-16 23:50:40,511 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2024-11-16 23:50:40,511 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 383 flow [2024-11-16 23:50:40,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:50:40,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:40,512 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 23:50:40,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:50:40,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:40,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2085304248, now seen corresponding path program 1 times [2024-11-16 23:50:40,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:40,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276816250] [2024-11-16 23:50:40,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:40,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 23:50:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276816250] [2024-11-16 23:50:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276816250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854538841] [2024-11-16 23:50:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:40,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-16 23:50:40,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50:40,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:40,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-16 23:50:40,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:40,797 INFO L124 PetriNetUnfolderBase]: 177/1419 cut-off events. [2024-11-16 23:50:40,798 INFO L125 PetriNetUnfolderBase]: For 731/779 co-relation queries the response was YES. [2024-11-16 23:50:40,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1419 events. 177/1419 cut-off events. For 731/779 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10953 event pairs, 135 based on Foata normal form. 3/1308 useless extension candidates. Maximal degree in co-relation 2467. Up to 336 conditions per place. [2024-11-16 23:50:40,807 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 23 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2024-11-16 23:50:40,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 131 transitions, 457 flow [2024-11-16 23:50:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2024-11-16 23:50:40,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-16 23:50:40,809 INFO L175 Difference]: Start difference. First operand has 137 places, 126 transitions, 383 flow. Second operand 3 states and 305 transitions. [2024-11-16 23:50:40,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 131 transitions, 457 flow [2024-11-16 23:50:40,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 131 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:50:40,814 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 411 flow [2024-11-16 23:50:40,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2024-11-16 23:50:40,815 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2024-11-16 23:50:40,815 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 411 flow [2024-11-16 23:50:40,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50:40,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:40,816 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:50:40,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:50:40,816 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-16 23:50:40,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 723358912, now seen corresponding path program 1 times [2024-11-16 23:50:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:40,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568203359] [2024-11-16 23:50:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:40,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:50:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:50:40,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:50:40,878 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:50:40,880 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-16 23:50:40,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-16 23:50:40,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-16 23:50:40,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-16 23:50:40,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-16 23:50:40,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-16 23:50:40,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-16 23:50:40,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-16 23:50:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:50:40,882 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:50:40,883 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:50:40,883 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-16 23:50:40,914 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-16 23:50:40,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 133 transitions, 306 flow [2024-11-16 23:50:40,981 INFO L124 PetriNetUnfolderBase]: 42/586 cut-off events. [2024-11-16 23:50:40,981 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-16 23:50:40,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 586 events. 42/586 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2157 event pairs, 6 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 363. Up to 32 conditions per place. [2024-11-16 23:50:40,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 133 transitions, 306 flow [2024-11-16 23:50:40,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 306 flow [2024-11-16 23:50:40,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:50:40,988 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;@4ccb0693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:50:40,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-16 23:50:40,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:50:40,990 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-16 23:50:40,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:50:40,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:40,990 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] [2024-11-16 23:50:40,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -670444522, now seen corresponding path program 1 times [2024-11-16 23:50:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227479517] [2024-11-16 23:50:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:41,003 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:50:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227479517] [2024-11-16 23:50:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227479517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:41,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:41,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21305410] [2024-11-16 23:50:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:41,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:50:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:50:41,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:50:41,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 133 [2024-11-16 23:50:41,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 306 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 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:50:41,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:41,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 133 [2024-11-16 23:50:41,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:41,515 INFO L124 PetriNetUnfolderBase]: 585/4224 cut-off events. [2024-11-16 23:50:41,515 INFO L125 PetriNetUnfolderBase]: For 1323/1870 co-relation queries the response was YES. [2024-11-16 23:50:41,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 4224 events. 585/4224 cut-off events. For 1323/1870 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 40278 event pairs, 536 based on Foata normal form. 321/4051 useless extension candidates. Maximal degree in co-relation 3527. Up to 877 conditions per place. [2024-11-16 23:50:41,552 INFO L140 encePairwiseOnDemand]: 131/133 looper letters, 16 selfloop transitions, 0 changer transitions 0/131 dead transitions. [2024-11-16 23:50:41,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 334 flow [2024-11-16 23:50:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:50:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:50:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2024-11-16 23:50:41,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9323308270676691 [2024-11-16 23:50:41,554 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 306 flow. Second operand 2 states and 248 transitions. [2024-11-16 23:50:41,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 334 flow [2024-11-16 23:50:41,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:41,557 INFO L231 Difference]: Finished difference. Result has 137 places, 131 transitions, 302 flow [2024-11-16 23:50:41,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=302, PETRI_PLACES=137, PETRI_TRANSITIONS=131} [2024-11-16 23:50:41,558 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2024-11-16 23:50:41,558 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 131 transitions, 302 flow [2024-11-16 23:50:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 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:50:41,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:41,559 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] [2024-11-16 23:50:41,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 23:50:41,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash -954622484, now seen corresponding path program 1 times [2024-11-16 23:50:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850806711] [2024-11-16 23:50:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:41,591 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:50:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:41,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850806711] [2024-11-16 23:50:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850806711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084280818] [2024-11-16 23:50:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:41,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-16 23:50:41,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 131 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:50:41,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:41,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-16 23:50:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:42,341 INFO L124 PetriNetUnfolderBase]: 2017/8271 cut-off events. [2024-11-16 23:50:42,341 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-11-16 23:50:42,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11673 conditions, 8271 events. 2017/8271 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 84107 event pairs, 1191 based on Foata normal form. 1/7557 useless extension candidates. Maximal degree in co-relation 11666. Up to 2119 conditions per place. [2024-11-16 23:50:42,403 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-16 23:50:42,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 392 flow [2024-11-16 23:50:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2024-11-16 23:50:42,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778195488721805 [2024-11-16 23:50:42,405 INFO L175 Difference]: Start difference. First operand has 137 places, 131 transitions, 302 flow. Second operand 4 states and 467 transitions. [2024-11-16 23:50:42,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 392 flow [2024-11-16 23:50:42,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:50:42,408 INFO L231 Difference]: Finished difference. Result has 141 places, 132 transitions, 318 flow [2024-11-16 23:50:42,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=141, PETRI_TRANSITIONS=132} [2024-11-16 23:50:42,408 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2024-11-16 23:50:42,408 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 132 transitions, 318 flow [2024-11-16 23:50:42,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:50:42,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:42,409 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] [2024-11-16 23:50:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 23:50:42,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1870159130, now seen corresponding path program 1 times [2024-11-16 23:50:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728180540] [2024-11-16 23:50:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:42,575 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:50:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:42,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728180540] [2024-11-16 23:50:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728180540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:42,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:50:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686443891] [2024-11-16 23:50:42,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:42,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:50:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:50:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:50:42,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 133 [2024-11-16 23:50:42,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:50:42,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:42,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 133 [2024-11-16 23:50:42,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:44,350 INFO L124 PetriNetUnfolderBase]: 6236/15890 cut-off events. [2024-11-16 23:50:44,350 INFO L125 PetriNetUnfolderBase]: For 1706/1706 co-relation queries the response was YES. [2024-11-16 23:50:44,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 15890 events. 6236/15890 cut-off events. For 1706/1706 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 160228 event pairs, 2634 based on Foata normal form. 0/14948 useless extension candidates. Maximal degree in co-relation 25946. Up to 6781 conditions per place. [2024-11-16 23:50:44,466 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-11-16 23:50:44,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 163 transitions, 514 flow [2024-11-16 23:50:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:50:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:50:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2024-11-16 23:50:44,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8057644110275689 [2024-11-16 23:50:44,470 INFO L175 Difference]: Start difference. First operand has 141 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2024-11-16 23:50:44,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 163 transitions, 514 flow [2024-11-16 23:50:44,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:44,482 INFO L231 Difference]: Finished difference. Result has 143 places, 131 transitions, 320 flow [2024-11-16 23:50:44,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=143, PETRI_TRANSITIONS=131} [2024-11-16 23:50:44,483 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2024-11-16 23:50:44,483 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 320 flow [2024-11-16 23:50:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:50:44,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:44,484 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] [2024-11-16 23:50:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 23:50:44,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1421830989, now seen corresponding path program 1 times [2024-11-16 23:50:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33615787] [2024-11-16 23:50:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:44,510 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:50:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:44,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33615787] [2024-11-16 23:50:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33615787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:44,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135814979] [2024-11-16 23:50:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:44,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:44,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-16 23:50:44,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:50:44,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:44,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-16 23:50:44,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:47,084 INFO L124 PetriNetUnfolderBase]: 7241/23308 cut-off events. [2024-11-16 23:50:47,084 INFO L125 PetriNetUnfolderBase]: For 5895/7986 co-relation queries the response was YES. [2024-11-16 23:50:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35579 conditions, 23308 events. 7241/23308 cut-off events. For 5895/7986 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 283809 event pairs, 4420 based on Foata normal form. 16/20550 useless extension candidates. Maximal degree in co-relation 35570. Up to 8528 conditions per place. [2024-11-16 23:50:47,376 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2024-11-16 23:50:47,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 149 transitions, 472 flow [2024-11-16 23:50:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2024-11-16 23:50:47,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072681704260651 [2024-11-16 23:50:47,378 INFO L175 Difference]: Start difference. First operand has 143 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2024-11-16 23:50:47,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 149 transitions, 472 flow [2024-11-16 23:50:47,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:50:47,384 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 364 flow [2024-11-16 23:50:47,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2024-11-16 23:50:47,385 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2024-11-16 23:50:47,385 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 364 flow [2024-11-16 23:50:47,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:50:47,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:47,385 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] [2024-11-16 23:50:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 23:50:47,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 459854307, now seen corresponding path program 1 times [2024-11-16 23:50:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798197456] [2024-11-16 23:50:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:47,435 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:50:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798197456] [2024-11-16 23:50:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798197456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:50:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784493846] [2024-11-16 23:50:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:50:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:50:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:50:47,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-16 23:50:47,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:50:47,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:47,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-16 23:50:47,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:49,677 INFO L124 PetriNetUnfolderBase]: 5437/19606 cut-off events. [2024-11-16 23:50:49,677 INFO L125 PetriNetUnfolderBase]: For 2734/2800 co-relation queries the response was YES. [2024-11-16 23:50:49,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30029 conditions, 19606 events. 5437/19606 cut-off events. For 2734/2800 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 237190 event pairs, 2945 based on Foata normal form. 259/17469 useless extension candidates. Maximal degree in co-relation 30019. Up to 3835 conditions per place. [2024-11-16 23:50:49,825 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-11-16 23:50:49,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 506 flow [2024-11-16 23:50:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:50:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:50:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2024-11-16 23:50:49,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8966165413533834 [2024-11-16 23:50:49,827 INFO L175 Difference]: Start difference. First operand has 142 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2024-11-16 23:50:49,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 506 flow [2024-11-16 23:50:49,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:49,843 INFO L231 Difference]: Finished difference. Result has 144 places, 138 transitions, 366 flow [2024-11-16 23:50:49,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=144, PETRI_TRANSITIONS=138} [2024-11-16 23:50:49,844 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2024-11-16 23:50:49,844 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 138 transitions, 366 flow [2024-11-16 23:50:49,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:50:49,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:49,844 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] [2024-11-16 23:50:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 23:50:49,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -691305024, now seen corresponding path program 1 times [2024-11-16 23:50:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:49,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016426333] [2024-11-16 23:50:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:49,924 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:50:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016426333] [2024-11-16 23:50:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016426333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:50:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511187042] [2024-11-16 23:50:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:50:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:50:49,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 23:50:49,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 23:50:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:50,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:50:50,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:50:50,119 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:50:50,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:50:50,315 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:50:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511187042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:50:50,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:50:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-16 23:50:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403152880] [2024-11-16 23:50:50,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:50:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 23:50:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 23:50:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-16 23:50:50,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-16 23:50:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 138 transitions, 366 flow. Second operand has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 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:50:50,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:50,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-16 23:50:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:53,444 INFO L124 PetriNetUnfolderBase]: 6978/25580 cut-off events. [2024-11-16 23:50:53,444 INFO L125 PetriNetUnfolderBase]: For 3512/3512 co-relation queries the response was YES. [2024-11-16 23:50:53,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39127 conditions, 25580 events. 6978/25580 cut-off events. For 3512/3512 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 321654 event pairs, 1505 based on Foata normal form. 15/22116 useless extension candidates. Maximal degree in co-relation 39116. Up to 4886 conditions per place. [2024-11-16 23:50:53,610 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 58 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2024-11-16 23:50:53,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 180 transitions, 590 flow [2024-11-16 23:50:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:50:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:50:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1121 transitions. [2024-11-16 23:50:53,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2024-11-16 23:50:53,613 INFO L175 Difference]: Start difference. First operand has 144 places, 138 transitions, 366 flow. Second operand 10 states and 1121 transitions. [2024-11-16 23:50:53,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 180 transitions, 590 flow [2024-11-16 23:50:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 180 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:53,647 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 416 flow [2024-11-16 23:50:53,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=416, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2024-11-16 23:50:53,647 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 18 predicate places. [2024-11-16 23:50:53,648 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 416 flow [2024-11-16 23:50:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 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:50:53,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:53,649 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] [2024-11-16 23:50:53,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 23:50:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:50:53,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:53,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash 109235699, now seen corresponding path program 1 times [2024-11-16 23:50:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594717726] [2024-11-16 23:50:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594717726] [2024-11-16 23:50:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594717726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:53,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:53,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708804778] [2024-11-16 23:50:53,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:53,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-16 23:50:53,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:50:53,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:53,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-16 23:50:53,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:57,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L698-3-->L698-2: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][157], [139#true, Black: 160#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 448#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), 452#true, Black: 266#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 20#L686-3true, 164#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 131#true, 133#true, 134#true, 136#true, Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L698-2true, 78#L685-1true, Black: 154#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|)]) [2024-11-16 23:50:57,410 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-16 23:50:57,410 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-16 23:50:57,410 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-16 23:50:57,410 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-16 23:50:57,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L698-3-->L698-2: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][157], [139#true, Black: 160#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 448#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), 452#true, Black: 266#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 164#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 131#true, 133#true, 134#true, 81#L686true, 136#true, Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L698-2true, 78#L685-1true, Black: 154#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|)]) [2024-11-16 23:50:57,423 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2024-11-16 23:50:57,424 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-16 23:50:57,424 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-16 23:50:57,424 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-16 23:50:57,461 INFO L124 PetriNetUnfolderBase]: 8673/28773 cut-off events. [2024-11-16 23:50:57,461 INFO L125 PetriNetUnfolderBase]: For 11346/13484 co-relation queries the response was YES. [2024-11-16 23:50:57,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50304 conditions, 28773 events. 8673/28773 cut-off events. For 11346/13484 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 369577 event pairs, 5334 based on Foata normal form. 21/25865 useless extension candidates. Maximal degree in co-relation 50290. Up to 9950 conditions per place. [2024-11-16 23:50:57,659 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 38 selfloop transitions, 11 changer transitions 0/164 dead transitions. [2024-11-16 23:50:57,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 593 flow [2024-11-16 23:50:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-16 23:50:57,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-16 23:50:57,661 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 416 flow. Second operand 3 states and 361 transitions. [2024-11-16 23:50:57,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 164 transitions, 593 flow [2024-11-16 23:50:57,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 164 transitions, 585 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:57,693 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 504 flow [2024-11-16 23:50:57,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2024-11-16 23:50:57,694 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2024-11-16 23:50:57,694 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 504 flow [2024-11-16 23:50:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:50:57,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:57,695 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] [2024-11-16 23:50:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 23:50:57,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1711124427, now seen corresponding path program 1 times [2024-11-16 23:50:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187812764] [2024-11-16 23:50:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 23:50:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187812764] [2024-11-16 23:50:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187812764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:57,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:50:57,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299762727] [2024-11-16 23:50:57,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:57,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:57,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:57,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133 [2024-11-16 23:50:57,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:50:57,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:57,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133 [2024-11-16 23:50:57,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:58,471 INFO L124 PetriNetUnfolderBase]: 472/4772 cut-off events. [2024-11-16 23:50:58,472 INFO L125 PetriNetUnfolderBase]: For 1657/1911 co-relation queries the response was YES. [2024-11-16 23:50:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7392 conditions, 4772 events. 472/4772 cut-off events. For 1657/1911 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 51339 event pairs, 234 based on Foata normal form. 128/4455 useless extension candidates. Maximal degree in co-relation 7377. Up to 454 conditions per place. [2024-11-16 23:50:58,504 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2024-11-16 23:50:58,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 531 flow [2024-11-16 23:50:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2024-11-16 23:50:58,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-11-16 23:50:58,506 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 504 flow. Second operand 3 states and 370 transitions. [2024-11-16 23:50:58,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 531 flow [2024-11-16 23:50:58,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 519 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:50:58,518 INFO L231 Difference]: Finished difference. Result has 156 places, 144 transitions, 440 flow [2024-11-16 23:50:58,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=156, PETRI_TRANSITIONS=144} [2024-11-16 23:50:58,519 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2024-11-16 23:50:58,519 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 144 transitions, 440 flow [2024-11-16 23:50:58,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:50:58,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:58,520 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 23:50:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 23:50:58,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1044545544, now seen corresponding path program 1 times [2024-11-16 23:50:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993715575] [2024-11-16 23:50:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 23:50:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993715575] [2024-11-16 23:50:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993715575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:50:58,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:50:58,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:50:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660342221] [2024-11-16 23:50:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:50:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:50:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:50:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:50:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:50:58,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-16 23:50:58,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 144 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:50:58,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:58,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-16 23:50:58,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:50:59,352 INFO L124 PetriNetUnfolderBase]: 928/5608 cut-off events. [2024-11-16 23:50:59,352 INFO L125 PetriNetUnfolderBase]: For 3649/3793 co-relation queries the response was YES. [2024-11-16 23:50:59,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10219 conditions, 5608 events. 928/5608 cut-off events. For 3649/3793 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 62070 event pairs, 707 based on Foata normal form. 7/5103 useless extension candidates. Maximal degree in co-relation 10204. Up to 1545 conditions per place. [2024-11-16 23:50:59,377 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2024-11-16 23:50:59,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 544 flow [2024-11-16 23:50:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:50:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:50:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-11-16 23:50:59,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8796992481203008 [2024-11-16 23:50:59,379 INFO L175 Difference]: Start difference. First operand has 156 places, 144 transitions, 440 flow. Second operand 3 states and 351 transitions. [2024-11-16 23:50:59,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 544 flow [2024-11-16 23:50:59,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:50:59,388 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 466 flow [2024-11-16 23:50:59,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-11-16 23:50:59,389 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 23 predicate places. [2024-11-16 23:50:59,389 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 466 flow [2024-11-16 23:50:59,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:50:59,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:50:59,390 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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:50:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 23:50:59,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:50:59,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:50:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1035906389, now seen corresponding path program 1 times [2024-11-16 23:50:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:50:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523308567] [2024-11-16 23:50:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:50:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:50:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:50:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523308567] [2024-11-16 23:50:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523308567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:50:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146173549] [2024-11-16 23:50:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:50:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:50:59,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:50:59,588 INFO L229 MonitoredProcess]: Starting monitored process 5 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:50:59,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 23:50:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:50:59,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 23:50:59,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:50:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:50:59,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:51:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:00,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146173549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:51:00,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:51:00,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-16 23:51:00,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674984653] [2024-11-16 23:51:00,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:51:00,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 23:51:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 23:51:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-16 23:51:00,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-16 23:51:00,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 466 flow. Second operand has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 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:51:00,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:00,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-16 23:51:00,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:01,381 INFO L124 PetriNetUnfolderBase]: 1216/8404 cut-off events. [2024-11-16 23:51:01,382 INFO L125 PetriNetUnfolderBase]: For 3720/3986 co-relation queries the response was YES. [2024-11-16 23:51:01,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14034 conditions, 8404 events. 1216/8404 cut-off events. For 3720/3986 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 91048 event pairs, 181 based on Foata normal form. 20/7687 useless extension candidates. Maximal degree in co-relation 14017. Up to 893 conditions per place. [2024-11-16 23:51:01,420 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 84 selfloop transitions, 14 changer transitions 1/213 dead transitions. [2024-11-16 23:51:01,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 213 transitions, 872 flow [2024-11-16 23:51:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 23:51:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-16 23:51:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1570 transitions. [2024-11-16 23:51:01,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8431793770139635 [2024-11-16 23:51:01,424 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 466 flow. Second operand 14 states and 1570 transitions. [2024-11-16 23:51:01,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 213 transitions, 872 flow [2024-11-16 23:51:01,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 213 transitions, 860 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:51:01,436 INFO L231 Difference]: Finished difference. Result has 174 places, 151 transitions, 521 flow [2024-11-16 23:51:01,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=521, PETRI_PLACES=174, PETRI_TRANSITIONS=151} [2024-11-16 23:51:01,436 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2024-11-16 23:51:01,437 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 521 flow [2024-11-16 23:51:01,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 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:51:01,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:01,438 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:51:01,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 23:51:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:01,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 896612428, now seen corresponding path program 1 times [2024-11-16 23:51:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435061590] [2024-11-16 23:51:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-16 23:51:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435061590] [2024-11-16 23:51:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435061590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:51:01,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:51:01,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:51:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940907482] [2024-11-16 23:51:01,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:51:01,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:51:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:01,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:51:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:51:01,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-16 23:51:01,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:51:01,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:01,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-16 23:51:01,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:02,507 INFO L124 PetriNetUnfolderBase]: 883/5676 cut-off events. [2024-11-16 23:51:02,507 INFO L125 PetriNetUnfolderBase]: For 4322/4418 co-relation queries the response was YES. [2024-11-16 23:51:02,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 5676 events. 883/5676 cut-off events. For 4322/4418 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 62019 event pairs, 677 based on Foata normal form. 4/5178 useless extension candidates. Maximal degree in co-relation 10721. Up to 1476 conditions per place. [2024-11-16 23:51:02,553 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-16 23:51:02,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 157 transitions, 616 flow [2024-11-16 23:51:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:51:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:51:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-11-16 23:51:02,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2024-11-16 23:51:02,555 INFO L175 Difference]: Start difference. First operand has 174 places, 151 transitions, 521 flow. Second operand 3 states and 350 transitions. [2024-11-16 23:51:02,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 157 transitions, 616 flow [2024-11-16 23:51:02,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 157 transitions, 598 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-16 23:51:02,584 INFO L231 Difference]: Finished difference. Result has 171 places, 154 transitions, 539 flow [2024-11-16 23:51:02,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=171, PETRI_TRANSITIONS=154} [2024-11-16 23:51:02,585 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 35 predicate places. [2024-11-16 23:51:02,585 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 154 transitions, 539 flow [2024-11-16 23:51:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:51:02,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:02,585 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:51:02,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 23:51:02,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1593136399, now seen corresponding path program 1 times [2024-11-16 23:51:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:02,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504128837] [2024-11-16 23:51:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 103 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504128837] [2024-11-16 23:51:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504128837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:51:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828796155] [2024-11-16 23:51:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:02,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:51:02,859 INFO L229 MonitoredProcess]: Starting monitored process 6 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:51:02,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 23:51:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:03,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 23:51:03,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:51:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:03,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:51:03,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828796155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:51:03,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:51:03,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2024-11-16 23:51:03,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420423235] [2024-11-16 23:51:03,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:51:03,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 23:51:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 23:51:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-16 23:51:03,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-16 23:51:03,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 154 transitions, 539 flow. Second operand has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 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:51:03,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:03,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-16 23:51:03,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:04,822 INFO L124 PetriNetUnfolderBase]: 1126/7909 cut-off events. [2024-11-16 23:51:04,822 INFO L125 PetriNetUnfolderBase]: For 5117/5421 co-relation queries the response was YES. [2024-11-16 23:51:04,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14214 conditions, 7909 events. 1126/7909 cut-off events. For 5117/5421 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 85810 event pairs, 151 based on Foata normal form. 48/7239 useless extension candidates. Maximal degree in co-relation 14192. Up to 557 conditions per place. [2024-11-16 23:51:04,870 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 89 selfloop transitions, 16 changer transitions 8/230 dead transitions. [2024-11-16 23:51:04,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 230 transitions, 986 flow [2024-11-16 23:51:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 23:51:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-16 23:51:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1810 transitions. [2024-11-16 23:51:04,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505639097744361 [2024-11-16 23:51:04,873 INFO L175 Difference]: Start difference. First operand has 171 places, 154 transitions, 539 flow. Second operand 16 states and 1810 transitions. [2024-11-16 23:51:04,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 230 transitions, 986 flow [2024-11-16 23:51:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 230 transitions, 964 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-16 23:51:04,890 INFO L231 Difference]: Finished difference. Result has 179 places, 152 transitions, 534 flow [2024-11-16 23:51:04,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=534, PETRI_PLACES=179, PETRI_TRANSITIONS=152} [2024-11-16 23:51:04,890 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 43 predicate places. [2024-11-16 23:51:04,890 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 152 transitions, 534 flow [2024-11-16 23:51:04,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 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:51:04,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:04,891 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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:51:04,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 23:51:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-16 23:51:05,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -883772479, now seen corresponding path program 1 times [2024-11-16 23:51:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737691129] [2024-11-16 23:51:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 23:51:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737691129] [2024-11-16 23:51:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737691129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:51:05,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:51:05,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:51:05,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944892661] [2024-11-16 23:51:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:51:05,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:51:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:51:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:51:05,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2024-11-16 23:51:05,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 152 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:51:05,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:05,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2024-11-16 23:51:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:06,735 INFO L124 PetriNetUnfolderBase]: 2470/9488 cut-off events. [2024-11-16 23:51:06,735 INFO L125 PetriNetUnfolderBase]: For 3949/4177 co-relation queries the response was YES. [2024-11-16 23:51:06,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18891 conditions, 9488 events. 2470/9488 cut-off events. For 3949/4177 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 98954 event pairs, 1086 based on Foata normal form. 0/8769 useless extension candidates. Maximal degree in co-relation 18870. Up to 2061 conditions per place. [2024-11-16 23:51:06,786 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 59 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2024-11-16 23:51:06,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 183 transitions, 758 flow [2024-11-16 23:51:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:51:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:51:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2024-11-16 23:51:06,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.818295739348371 [2024-11-16 23:51:06,787 INFO L175 Difference]: Start difference. First operand has 179 places, 152 transitions, 534 flow. Second operand 6 states and 653 transitions. [2024-11-16 23:51:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 183 transitions, 758 flow [2024-11-16 23:51:06,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 704 flow, removed 3 selfloop flow, removed 17 redundant places. [2024-11-16 23:51:06,818 INFO L231 Difference]: Finished difference. Result has 166 places, 151 transitions, 490 flow [2024-11-16 23:51:06,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2024-11-16 23:51:06,819 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 30 predicate places. [2024-11-16 23:51:06,819 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 490 flow [2024-11-16 23:51:06,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:51:06,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:06,820 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-16 23:51:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 23:51:06,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 18819014, now seen corresponding path program 1 times [2024-11-16 23:51:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882791721] [2024-11-16 23:51:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-16 23:51:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882791721] [2024-11-16 23:51:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882791721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:51:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:51:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:51:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594080667] [2024-11-16 23:51:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:51:06,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:51:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:51:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:51:06,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-16 23:51:06,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:51:06,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:06,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-16 23:51:06,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:07,836 INFO L124 PetriNetUnfolderBase]: 1353/8900 cut-off events. [2024-11-16 23:51:07,836 INFO L125 PetriNetUnfolderBase]: For 5251/5335 co-relation queries the response was YES. [2024-11-16 23:51:07,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16942 conditions, 8900 events. 1353/8900 cut-off events. For 5251/5335 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 106256 event pairs, 605 based on Foata normal form. 0/8340 useless extension candidates. Maximal degree in co-relation 16923. Up to 1591 conditions per place. [2024-11-16 23:51:07,880 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 30 selfloop transitions, 9 changer transitions 1/164 dead transitions. [2024-11-16 23:51:07,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 624 flow [2024-11-16 23:51:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:51:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:51:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-16 23:51:07,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-16 23:51:07,882 INFO L175 Difference]: Start difference. First operand has 166 places, 151 transitions, 490 flow. Second operand 3 states and 361 transitions. [2024-11-16 23:51:07,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 624 flow [2024-11-16 23:51:07,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 164 transitions, 612 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:51:07,925 INFO L231 Difference]: Finished difference. Result has 165 places, 155 transitions, 554 flow [2024-11-16 23:51:07,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=165, PETRI_TRANSITIONS=155} [2024-11-16 23:51:07,925 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 29 predicate places. [2024-11-16 23:51:07,926 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 155 transitions, 554 flow [2024-11-16 23:51:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:51:07,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:07,927 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-16 23:51:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 23:51:07,927 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:07,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -227435589, now seen corresponding path program 1 times [2024-11-16 23:51:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46503695] [2024-11-16 23:51:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 23:51:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46503695] [2024-11-16 23:51:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46503695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:51:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896252035] [2024-11-16 23:51:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:51:08,070 INFO L229 MonitoredProcess]: Starting monitored process 7 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:51:08,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 23:51:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:08,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:51:08,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:51:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 23:51:08,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:51:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 23:51:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896252035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:51:08,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:51:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:51:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132620001] [2024-11-16 23:51:08,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:51:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:51:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:51:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:51:08,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 133 [2024-11-16 23:51:08,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 155 transitions, 554 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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:51:08,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:08,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 133 [2024-11-16 23:51:08,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:09,487 INFO L124 PetriNetUnfolderBase]: 1022/5699 cut-off events. [2024-11-16 23:51:09,487 INFO L125 PetriNetUnfolderBase]: For 3745/3941 co-relation queries the response was YES. [2024-11-16 23:51:09,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 5699 events. 1022/5699 cut-off events. For 3745/3941 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 57088 event pairs, 238 based on Foata normal form. 80/5659 useless extension candidates. Maximal degree in co-relation 10768. Up to 562 conditions per place. [2024-11-16 23:51:09,517 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 7 changer transitions 8/198 dead transitions. [2024-11-16 23:51:09,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 198 transitions, 830 flow [2024-11-16 23:51:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:51:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:51:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2024-11-16 23:51:09,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909774436090225 [2024-11-16 23:51:09,519 INFO L175 Difference]: Start difference. First operand has 165 places, 155 transitions, 554 flow. Second operand 6 states and 711 transitions. [2024-11-16 23:51:09,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 198 transitions, 830 flow [2024-11-16 23:51:09,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 198 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:51:09,531 INFO L231 Difference]: Finished difference. Result has 170 places, 157 transitions, 568 flow [2024-11-16 23:51:09,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=170, PETRI_TRANSITIONS=157} [2024-11-16 23:51:09,531 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2024-11-16 23:51:09,531 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 157 transitions, 568 flow [2024-11-16 23:51:09,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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:51:09,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:09,532 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-16 23:51:09,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 23:51:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-16 23:51:09,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1053927212, now seen corresponding path program 1 times [2024-11-16 23:51:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598410072] [2024-11-16 23:51:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598410072] [2024-11-16 23:51:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598410072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:51:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252714578] [2024-11-16 23:51:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:11,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:11,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:51:11,097 INFO L229 MonitoredProcess]: Starting monitored process 8 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:51:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 23:51:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:11,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 23:51:11,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:51:11,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 23:51:11,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 23:51:11,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 23:51:12,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-16 23:51:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:12,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:51:12,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-16 23:51:12,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-16 23:51:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252714578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:51:13,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:51:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 55 [2024-11-16 23:51:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128017473] [2024-11-16 23:51:13,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:51:13,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-16 23:51:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:13,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-16 23:51:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2024-11-16 23:51:14,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:16,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:18,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:20,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:22,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:24,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:26,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:27,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 133 [2024-11-16 23:51:27,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 157 transitions, 568 flow. Second operand has 55 states, 55 states have (on average 92.45454545454545) internal successors, (5085), 55 states have internal predecessors, (5085), 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:51:27,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:51:27,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 133 [2024-11-16 23:51:27,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:51:29,632 INFO L124 PetriNetUnfolderBase]: 2162/7805 cut-off events. [2024-11-16 23:51:29,632 INFO L125 PetriNetUnfolderBase]: For 4458/4654 co-relation queries the response was YES. [2024-11-16 23:51:29,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17049 conditions, 7805 events. 2162/7805 cut-off events. For 4458/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 75905 event pairs, 98 based on Foata normal form. 24/7600 useless extension candidates. Maximal degree in co-relation 17027. Up to 1108 conditions per place. [2024-11-16 23:51:29,706 INFO L140 encePairwiseOnDemand]: 115/133 looper letters, 152 selfloop transitions, 28 changer transitions 8/293 dead transitions. [2024-11-16 23:51:29,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 293 transitions, 1335 flow [2024-11-16 23:51:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 23:51:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-16 23:51:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2413 transitions. [2024-11-16 23:51:29,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7257142857142858 [2024-11-16 23:51:29,711 INFO L175 Difference]: Start difference. First operand has 170 places, 157 transitions, 568 flow. Second operand 25 states and 2413 transitions. [2024-11-16 23:51:29,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 293 transitions, 1335 flow [2024-11-16 23:51:29,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 293 transitions, 1327 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-16 23:51:29,729 INFO L231 Difference]: Finished difference. Result has 200 places, 165 transitions, 668 flow [2024-11-16 23:51:29,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=668, PETRI_PLACES=200, PETRI_TRANSITIONS=165} [2024-11-16 23:51:29,730 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 64 predicate places. [2024-11-16 23:51:29,730 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 165 transitions, 668 flow [2024-11-16 23:51:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 92.45454545454545) internal successors, (5085), 55 states have internal predecessors, (5085), 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:51:29,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:51:29,733 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-16 23:51:29,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 23:51:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:29,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-16 23:51:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:51:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1519402068, now seen corresponding path program 2 times [2024-11-16 23:51:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:51:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905250551] [2024-11-16 23:51:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:51:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:51:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:51:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:51:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905250551] [2024-11-16 23:51:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905250551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:51:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631376039] [2024-11-16 23:51:31,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:51:31,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:51:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:51:31,317 INFO L229 MonitoredProcess]: Starting monitored process 9 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:51:31,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 23:51:31,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:51:31,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:51:31,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 23:51:31,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:51:32,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 23:51:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 23:51:32,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 23:51:32,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-16 23:51:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:32,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:51:33,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-16 23:51:33,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-16 23:51:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:51:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631376039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:51:33,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:51:33,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 19] total 59 [2024-11-16 23:51:33,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776310215] [2024-11-16 23:51:33,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:51:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-16 23:51:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:51:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-16 23:51:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3142, Unknown=0, NotChecked=0, Total=3422 [2024-11-16 23:51:35,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:37,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:39,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:40,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:42,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:44,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:46,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-16 23:51:47,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]