./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:48,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:48,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:48,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:48,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:48,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:48,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:48,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:48,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:48,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:48,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:48,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:48,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:48,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:48,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:48,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:48,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:48,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:48,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:48,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 [2025-01-09 21:22:48,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:48,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:48,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:48,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:48,566 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:48,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-01-09 21:22:49,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f289d132f/d7314f13f1fd4780842c2802b37a7aa4/FLAG25cf7af5e [2025-01-09 21:22:50,029 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:50,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-01-09 21:22:50,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f289d132f/d7314f13f1fd4780842c2802b37a7aa4/FLAG25cf7af5e [2025-01-09 21:22:50,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f289d132f/d7314f13f1fd4780842c2802b37a7aa4 [2025-01-09 21:22:50,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:50,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:50,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:50,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:50,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:50,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50, skipping insertion in model container [2025-01-09 21:22:50,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:50,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:50,410 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:50,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:50,476 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:50,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50 WrapperNode [2025-01-09 21:22:50,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:50,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:50,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:50,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:50,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,507 INFO L138 Inliner]: procedures = 186, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 94 [2025-01-09 21:22:50,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:50,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:50,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:50,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:50,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:50,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:50,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:50,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:50,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (1/1) ... [2025-01-09 21:22:50,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:50,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:22:50,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:50,586 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:50,668 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:50,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:50,809 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:50,809 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:50,824 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:50,824 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:50,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:50 BoogieIcfgContainer [2025-01-09 21:22:50,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:50,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:50,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:50,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:50" (1/3) ... [2025-01-09 21:22:50,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:50, skipping insertion in model container [2025-01-09 21:22:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:50" (2/3) ... [2025-01-09 21:22:50,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c1a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:50, skipping insertion in model container [2025-01-09 21:22:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:50" (3/3) ... [2025-01-09 21:22:50,831 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_15-list_entry_nr.i [2025-01-09 21:22:50,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:50,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_15-list_entry_nr.i that has 2 procedures, 112 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-01-09 21:22:50,843 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:50,881 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:50,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 226 flow [2025-01-09 21:22:50,934 INFO L124 PetriNetUnfolderBase]: 0/110 cut-off events. [2025-01-09 21:22:50,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 110 events. 0/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:22:50,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 226 flow [2025-01-09 21:22:50,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 110 transitions, 223 flow [2025-01-09 21:22:50,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:50,954 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;@13063ec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:50,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:22:50,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:50,957 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-09 21:22:50,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:50,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:50,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:50,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:50,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1145957465, now seen corresponding path program 1 times [2025-01-09 21:22:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-01-09 21:22:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:51,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 21:22:51,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 21:22:51,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:51,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371812980] [2025-01-09 21:22:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371812980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:51,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209086985] [2025-01-09 21:22:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:51,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:51,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:51,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:51,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-01-09 21:22:51,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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) [2025-01-09 21:22:51,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:51,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-01-09 21:22:51,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:51,213 INFO L124 PetriNetUnfolderBase]: 12/257 cut-off events. [2025-01-09 21:22:51,214 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:51,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 257 events. 12/257 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 709 event pairs, 12 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 252. Up to 37 conditions per place. [2025-01-09 21:22:51,219 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 12 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-01-09 21:22:51,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 249 flow [2025-01-09 21:22:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-01-09 21:22:51,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-01-09 21:22:51,232 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 223 flow. Second operand 3 states and 303 transitions. [2025-01-09 21:22:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 249 flow [2025-01-09 21:22:51,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:51,240 INFO L231 Difference]: Finished difference. Result has 114 places, 109 transitions, 224 flow [2025-01-09 21:22:51,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=114, PETRI_TRANSITIONS=109} [2025-01-09 21:22:51,246 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-01-09 21:22:51,247 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 109 transitions, 224 flow [2025-01-09 21:22:51,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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) [2025-01-09 21:22:51,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:51,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:51,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1477363984, now seen corresponding path program 1 times [2025-01-09 21:22:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303162012] [2025-01-09 21:22:51,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 21:22:51,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 21:22:51,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:51,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303162012] [2025-01-09 21:22:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303162012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231128129] [2025-01-09 21:22:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:51,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:51,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:51,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:51,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-01-09 21:22:51,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 109 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2025-01-09 21:22:51,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:51,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-01-09 21:22:51,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:51,378 INFO L124 PetriNetUnfolderBase]: 16/291 cut-off events. [2025-01-09 21:22:51,378 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:51,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 291 events. 16/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1012 event pairs, 16 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 323. Up to 43 conditions per place. [2025-01-09 21:22:51,381 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 11 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2025-01-09 21:22:51,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 242 flow [2025-01-09 21:22:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-01-09 21:22:51,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-01-09 21:22:51,385 INFO L175 Difference]: Start difference. First operand has 114 places, 109 transitions, 224 flow. Second operand 3 states and 303 transitions. [2025-01-09 21:22:51,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 106 transitions, 242 flow [2025-01-09 21:22:51,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:51,388 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 216 flow [2025-01-09 21:22:51,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-01-09 21:22:51,389 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-01-09 21:22:51,389 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 216 flow [2025-01-09 21:22:51,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2025-01-09 21:22:51,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:51,390 INFO L206 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] [2025-01-09 21:22:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:51,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 227862726, now seen corresponding path program 1 times [2025-01-09 21:22:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-01-09 21:22:51,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:51,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:22:51,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:22:51,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:51,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-01-09 21:22:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040230450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920541131] [2025-01-09 21:22:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:51,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:51,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:51,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:51,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 111 [2025-01-09 21:22:51,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:51,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:51,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 111 [2025-01-09 21:22:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:51,907 INFO L124 PetriNetUnfolderBase]: 100/544 cut-off events. [2025-01-09 21:22:51,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:51,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 544 events. 100/544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2874 event pairs, 100 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 763. Up to 227 conditions per place. [2025-01-09 21:22:51,909 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 26 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-01-09 21:22:51,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 276 flow [2025-01-09 21:22:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-01-09 21:22:51,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7597597597597597 [2025-01-09 21:22:51,911 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 216 flow. Second operand 6 states and 506 transitions. [2025-01-09 21:22:51,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 105 transitions, 276 flow [2025-01-09 21:22:51,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 105 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:51,913 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 223 flow [2025-01-09 21:22:51,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2025-01-09 21:22:51,913 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-01-09 21:22:51,913 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 223 flow [2025-01-09 21:22:51,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:22:51,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:51,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:51,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 452530334, now seen corresponding path program 1 times [2025-01-09 21:22:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-01-09 21:22:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:22:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:22:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:52,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-01-09 21:22:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:52,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482675321] [2025-01-09 21:22:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:52,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:52,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:52,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2025-01-09 21:22:52,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2025-01-09 21:22:52,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:52,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2025-01-09 21:22:52,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:52,511 INFO L124 PetriNetUnfolderBase]: 114/573 cut-off events. [2025-01-09 21:22:52,512 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:52,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 573 events. 114/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3160 event pairs, 61 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 826. Up to 211 conditions per place. [2025-01-09 21:22:52,519 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 34 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2025-01-09 21:22:52,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 134 transitions, 393 flow [2025-01-09 21:22:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 561 transitions. [2025-01-09 21:22:52,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8423423423423423 [2025-01-09 21:22:52,521 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 223 flow. Second operand 6 states and 561 transitions. [2025-01-09 21:22:52,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 134 transitions, 393 flow [2025-01-09 21:22:52,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 134 transitions, 383 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:52,529 INFO L231 Difference]: Finished difference. Result has 119 places, 126 transitions, 363 flow [2025-01-09 21:22:52,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=119, PETRI_TRANSITIONS=126} [2025-01-09 21:22:52,532 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-01-09 21:22:52,532 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 126 transitions, 363 flow [2025-01-09 21:22:52,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2025-01-09 21:22:52,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:52,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:52,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:52,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1521815766, now seen corresponding path program 1 times [2025-01-09 21:22:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:52,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-01-09 21:22:52,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:52,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:52,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:22:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:22:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746850499] [2025-01-09 21:22:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746850499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697245483] [2025-01-09 21:22:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:52,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2025-01-09 21:22:52,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 126 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2025-01-09 21:22:52,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:52,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2025-01-09 21:22:52,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:53,067 INFO L124 PetriNetUnfolderBase]: 152/680 cut-off events. [2025-01-09 21:22:53,068 INFO L125 PetriNetUnfolderBase]: For 133/153 co-relation queries the response was YES. [2025-01-09 21:22:53,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 680 events. 152/680 cut-off events. For 133/153 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4006 event pairs, 61 based on Foata normal form. 5/655 useless extension candidates. Maximal degree in co-relation 1181. Up to 268 conditions per place. [2025-01-09 21:22:53,073 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 47 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2025-01-09 21:22:53,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 155 transitions, 585 flow [2025-01-09 21:22:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 561 transitions. [2025-01-09 21:22:53,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8423423423423423 [2025-01-09 21:22:53,077 INFO L175 Difference]: Start difference. First operand has 119 places, 126 transitions, 363 flow. Second operand 6 states and 561 transitions. [2025-01-09 21:22:53,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 155 transitions, 585 flow [2025-01-09 21:22:53,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 155 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:53,082 INFO L231 Difference]: Finished difference. Result has 129 places, 147 transitions, 547 flow [2025-01-09 21:22:53,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=129, PETRI_TRANSITIONS=147} [2025-01-09 21:22:53,084 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 15 predicate places. [2025-01-09 21:22:53,084 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 147 transitions, 547 flow [2025-01-09 21:22:53,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2025-01-09 21:22:53,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:53,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:53,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:53,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:53,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1875655331, now seen corresponding path program 1 times [2025-01-09 21:22:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-01-09 21:22:53,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:53,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:22:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:22:53,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:53,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-01-09 21:22:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:53,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694379294] [2025-01-09 21:22:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:53,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:53,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:53,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:53,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2025-01-09 21:22:53,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 147 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2025-01-09 21:22:53,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:53,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2025-01-09 21:22:53,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:53,639 INFO L124 PetriNetUnfolderBase]: 292/1078 cut-off events. [2025-01-09 21:22:53,639 INFO L125 PetriNetUnfolderBase]: For 577/599 co-relation queries the response was YES. [2025-01-09 21:22:53,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 1078 events. 292/1078 cut-off events. For 577/599 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6912 event pairs, 101 based on Foata normal form. 9/1039 useless extension candidates. Maximal degree in co-relation 2418. Up to 532 conditions per place. [2025-01-09 21:22:53,644 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 72 selfloop transitions, 53 changer transitions 4/202 dead transitions. [2025-01-09 21:22:53,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 202 transitions, 1049 flow [2025-01-09 21:22:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-01-09 21:22:53,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213213213213213 [2025-01-09 21:22:53,646 INFO L175 Difference]: Start difference. First operand has 129 places, 147 transitions, 547 flow. Second operand 6 states and 547 transitions. [2025-01-09 21:22:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 202 transitions, 1049 flow [2025-01-09 21:22:53,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 202 transitions, 1049 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:53,651 INFO L231 Difference]: Finished difference. Result has 139 places, 194 transitions, 1029 flow [2025-01-09 21:22:53,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1029, PETRI_PLACES=139, PETRI_TRANSITIONS=194} [2025-01-09 21:22:53,652 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 25 predicate places. [2025-01-09 21:22:53,652 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 194 transitions, 1029 flow [2025-01-09 21:22:53,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2025-01-09 21:22:53,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:53,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:22:53,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash 134748965, now seen corresponding path program 1 times [2025-01-09 21:22:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489668305] [2025-01-09 21:22:53,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:22:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:22:53,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:53,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:53,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:53,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489668305] [2025-01-09 21:22:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489668305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:53,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118758651] [2025-01-09 21:22:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:53,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:53,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:53,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2025-01-09 21:22:53,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 194 transitions, 1029 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2025-01-09 21:22:53,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:53,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2025-01-09 21:22:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:54,191 INFO L124 PetriNetUnfolderBase]: 396/1383 cut-off events. [2025-01-09 21:22:54,191 INFO L125 PetriNetUnfolderBase]: For 1620/1661 co-relation queries the response was YES. [2025-01-09 21:22:54,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3760 conditions, 1383 events. 396/1383 cut-off events. For 1620/1661 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9387 event pairs, 107 based on Foata normal form. 4/1351 useless extension candidates. Maximal degree in co-relation 3728. Up to 677 conditions per place. [2025-01-09 21:22:54,200 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 109 selfloop transitions, 61 changer transitions 10/255 dead transitions. [2025-01-09 21:22:54,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 255 transitions, 1735 flow [2025-01-09 21:22:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-01-09 21:22:54,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213213213213213 [2025-01-09 21:22:54,202 INFO L175 Difference]: Start difference. First operand has 139 places, 194 transitions, 1029 flow. Second operand 6 states and 547 transitions. [2025-01-09 21:22:54,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 255 transitions, 1735 flow [2025-01-09 21:22:54,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 255 transitions, 1671 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:54,214 INFO L231 Difference]: Finished difference. Result has 149 places, 241 transitions, 1551 flow [2025-01-09 21:22:54,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1551, PETRI_PLACES=149, PETRI_TRANSITIONS=241} [2025-01-09 21:22:54,215 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 35 predicate places. [2025-01-09 21:22:54,215 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 241 transitions, 1551 flow [2025-01-09 21:22:54,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 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) [2025-01-09 21:22:54,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:54,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:22:54,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash -895514428, now seen corresponding path program 1 times [2025-01-09 21:22:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-01-09 21:22:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:54,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:22:54,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:22:54,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:54,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:55,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:55,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-01-09 21:22:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534511035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:22:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625208736] [2025-01-09 21:22:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:55,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:22:55,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 241 transitions, 1551 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:55,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:55,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:22:55,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:56,239 INFO L124 PetriNetUnfolderBase]: 620/2296 cut-off events. [2025-01-09 21:22:56,239 INFO L125 PetriNetUnfolderBase]: For 2949/3000 co-relation queries the response was YES. [2025-01-09 21:22:56,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6499 conditions, 2296 events. 620/2296 cut-off events. For 2949/3000 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18424 event pairs, 36 based on Foata normal form. 6/2288 useless extension candidates. Maximal degree in co-relation 6457. Up to 368 conditions per place. [2025-01-09 21:22:56,252 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 40 selfloop transitions, 18 changer transitions 18/288 dead transitions. [2025-01-09 21:22:56,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 288 transitions, 1797 flow [2025-01-09 21:22:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:22:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:22:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1143 transitions. [2025-01-09 21:22:56,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920997920997921 [2025-01-09 21:22:56,255 INFO L175 Difference]: Start difference. First operand has 149 places, 241 transitions, 1551 flow. Second operand 13 states and 1143 transitions. [2025-01-09 21:22:56,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 288 transitions, 1797 flow [2025-01-09 21:22:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 288 transitions, 1729 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:56,280 INFO L231 Difference]: Finished difference. Result has 168 places, 250 transitions, 1582 flow [2025-01-09 21:22:56,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1582, PETRI_PLACES=168, PETRI_TRANSITIONS=250} [2025-01-09 21:22:56,281 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 54 predicate places. [2025-01-09 21:22:56,281 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 250 transitions, 1582 flow [2025-01-09 21:22:56,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:56,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:56,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:22:56,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:56,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2121954808, now seen corresponding path program 2 times [2025-01-09 21:22:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-01-09 21:22:56,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:56,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:22:56,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:22:56,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:56,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-01-09 21:22:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4487649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:22:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621618576] [2025-01-09 21:22:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:56,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:57,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:22:57,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 250 transitions, 1582 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:57,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:57,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:22:57,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:57,898 INFO L124 PetriNetUnfolderBase]: 620/2370 cut-off events. [2025-01-09 21:22:57,898 INFO L125 PetriNetUnfolderBase]: For 3341/3420 co-relation queries the response was YES. [2025-01-09 21:22:57,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7125 conditions, 2370 events. 620/2370 cut-off events. For 3341/3420 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19157 event pairs, 37 based on Foata normal form. 13/2374 useless extension candidates. Maximal degree in co-relation 7072. Up to 366 conditions per place. [2025-01-09 21:22:57,910 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 34 selfloop transitions, 23 changer transitions 24/293 dead transitions. [2025-01-09 21:22:57,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 293 transitions, 1914 flow [2025-01-09 21:22:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:22:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:22:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-01-09 21:22:57,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-01-09 21:22:57,912 INFO L175 Difference]: Start difference. First operand has 168 places, 250 transitions, 1582 flow. Second operand 13 states and 1139 transitions. [2025-01-09 21:22:57,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 293 transitions, 1914 flow [2025-01-09 21:22:57,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 293 transitions, 1889 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:22:57,930 INFO L231 Difference]: Finished difference. Result has 177 places, 250 transitions, 1625 flow [2025-01-09 21:22:57,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1625, PETRI_PLACES=177, PETRI_TRANSITIONS=250} [2025-01-09 21:22:57,930 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 63 predicate places. [2025-01-09 21:22:57,930 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 250 transitions, 1625 flow [2025-01-09 21:22:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:57,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:57,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:22:57,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:57,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1450919672, now seen corresponding path program 3 times [2025-01-09 21:22:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-01-09 21:22:57,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:22:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:57,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:22:57,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:22:57,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:22:57,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-01-09 21:22:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329211153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:22:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-01-09 21:22:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:58,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:22:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:22:58,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:22:58,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:22:58,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 250 transitions, 1625 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:58,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:22:58,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:59,286 INFO L124 PetriNetUnfolderBase]: 563/2153 cut-off events. [2025-01-09 21:22:59,287 INFO L125 PetriNetUnfolderBase]: For 3517/3608 co-relation queries the response was YES. [2025-01-09 21:22:59,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 2153 events. 563/2153 cut-off events. For 3517/3608 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 17008 event pairs, 21 based on Foata normal form. 12/2159 useless extension candidates. Maximal degree in co-relation 6700. Up to 368 conditions per place. [2025-01-09 21:22:59,300 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 42 selfloop transitions, 19 changer transitions 16/289 dead transitions. [2025-01-09 21:22:59,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 289 transitions, 2009 flow [2025-01-09 21:22:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:22:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:22:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1137 transitions. [2025-01-09 21:22:59,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879417879417879 [2025-01-09 21:22:59,303 INFO L175 Difference]: Start difference. First operand has 177 places, 250 transitions, 1625 flow. Second operand 13 states and 1137 transitions. [2025-01-09 21:22:59,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 289 transitions, 2009 flow [2025-01-09 21:22:59,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 289 transitions, 1909 flow, removed 9 selfloop flow, removed 11 redundant places. [2025-01-09 21:22:59,324 INFO L231 Difference]: Finished difference. Result has 182 places, 255 transitions, 1673 flow [2025-01-09 21:22:59,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1673, PETRI_PLACES=182, PETRI_TRANSITIONS=255} [2025-01-09 21:22:59,324 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 68 predicate places. [2025-01-09 21:22:59,324 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 255 transitions, 1673 flow [2025-01-09 21:22:59,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:22:59,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:59,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:59,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:22:59,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:22:59,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1466922172, now seen corresponding path program 4 times [2025-01-09 21:22:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-01-09 21:22:59,326 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:22:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:59,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:22:59,345 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:22:59,345 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:22:59,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:00,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-01-09 21:23:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308431626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:00,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:23:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171715896] [2025-01-09 21:23:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:00,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:23:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:00,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:23:00,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:23:00,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-01-09 21:23:00,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 255 transitions, 1673 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:00,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:00,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-01-09 21:23:00,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:02,120 INFO L124 PetriNetUnfolderBase]: 1519/4720 cut-off events. [2025-01-09 21:23:02,121 INFO L125 PetriNetUnfolderBase]: For 13840/14121 co-relation queries the response was YES. [2025-01-09 21:23:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17370 conditions, 4720 events. 1519/4720 cut-off events. For 13840/14121 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 41610 event pairs, 108 based on Foata normal form. 104/4798 useless extension candidates. Maximal degree in co-relation 17312. Up to 1137 conditions per place. [2025-01-09 21:23:02,149 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 454 selfloop transitions, 120 changer transitions 45/711 dead transitions. [2025-01-09 21:23:02,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 711 transitions, 6720 flow [2025-01-09 21:23:02,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 21:23:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-09 21:23:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2023 transitions. [2025-01-09 21:23:02,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.729009009009009 [2025-01-09 21:23:02,153 INFO L175 Difference]: Start difference. First operand has 182 places, 255 transitions, 1673 flow. Second operand 25 states and 2023 transitions. [2025-01-09 21:23:02,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 711 transitions, 6720 flow [2025-01-09 21:23:02,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 711 transitions, 6577 flow, removed 61 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:02,197 INFO L231 Difference]: Finished difference. Result has 215 places, 356 transitions, 3121 flow [2025-01-09 21:23:02,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3121, PETRI_PLACES=215, PETRI_TRANSITIONS=356} [2025-01-09 21:23:02,198 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 101 predicate places. [2025-01-09 21:23:02,198 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 356 transitions, 3121 flow [2025-01-09 21:23:02,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:02,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:02,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:02,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:02,199 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1614284322, now seen corresponding path program 5 times [2025-01-09 21:23:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374420514] [2025-01-09 21:23:02,199 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:02,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:02,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:02,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:02,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:02,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:02,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374420514] [2025-01-09 21:23:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374420514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:02,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:02,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:02,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025943130] [2025-01-09 21:23:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:02,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:02,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:02,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:03,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:03,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 356 transitions, 3121 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:03,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:03,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:03,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:03,807 INFO L124 PetriNetUnfolderBase]: 1371/4716 cut-off events. [2025-01-09 21:23:03,808 INFO L125 PetriNetUnfolderBase]: For 13591/13828 co-relation queries the response was YES. [2025-01-09 21:23:03,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16669 conditions, 4716 events. 1371/4716 cut-off events. For 13591/13828 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 44986 event pairs, 57 based on Foata normal form. 38/4738 useless extension candidates. Maximal degree in co-relation 16595. Up to 884 conditions per place. [2025-01-09 21:23:03,841 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 64 selfloop transitions, 29 changer transitions 6/385 dead transitions. [2025-01-09 21:23:03,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 385 transitions, 3516 flow [2025-01-09 21:23:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1132 transitions. [2025-01-09 21:23:03,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7844767844767845 [2025-01-09 21:23:03,843 INFO L175 Difference]: Start difference. First operand has 215 places, 356 transitions, 3121 flow. Second operand 13 states and 1132 transitions. [2025-01-09 21:23:03,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 385 transitions, 3516 flow [2025-01-09 21:23:03,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 385 transitions, 3443 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:03,912 INFO L231 Difference]: Finished difference. Result has 226 places, 359 transitions, 3159 flow [2025-01-09 21:23:03,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3061, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3159, PETRI_PLACES=226, PETRI_TRANSITIONS=359} [2025-01-09 21:23:03,914 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 112 predicate places. [2025-01-09 21:23:03,914 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 359 transitions, 3159 flow [2025-01-09 21:23:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:03,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:03,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:03,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:03,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2013641010, now seen corresponding path program 6 times [2025-01-09 21:23:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-01-09 21:23:03,916 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:03,928 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:03,934 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:03,938 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-01-09 21:23:04,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936300342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256200927] [2025-01-09 21:23:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:04,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:04,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:04,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:04,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 359 transitions, 3159 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:04,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:04,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:05,822 INFO L124 PetriNetUnfolderBase]: 1642/5628 cut-off events. [2025-01-09 21:23:05,826 INFO L125 PetriNetUnfolderBase]: For 16651/16962 co-relation queries the response was YES. [2025-01-09 21:23:05,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20111 conditions, 5628 events. 1642/5628 cut-off events. For 16651/16962 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 55780 event pairs, 76 based on Foata normal form. 31/5638 useless extension candidates. Maximal degree in co-relation 20032. Up to 1023 conditions per place. [2025-01-09 21:23:05,883 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 69 selfloop transitions, 35 changer transitions 4/394 dead transitions. [2025-01-09 21:23:05,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 394 transitions, 3669 flow [2025-01-09 21:23:05,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1132 transitions. [2025-01-09 21:23:05,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7844767844767845 [2025-01-09 21:23:05,890 INFO L175 Difference]: Start difference. First operand has 226 places, 359 transitions, 3159 flow. Second operand 13 states and 1132 transitions. [2025-01-09 21:23:05,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 394 transitions, 3669 flow [2025-01-09 21:23:06,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 394 transitions, 3596 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:06,072 INFO L231 Difference]: Finished difference. Result has 234 places, 367 transitions, 3311 flow [2025-01-09 21:23:06,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3107, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3311, PETRI_PLACES=234, PETRI_TRANSITIONS=367} [2025-01-09 21:23:06,078 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 120 predicate places. [2025-01-09 21:23:06,078 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 367 transitions, 3311 flow [2025-01-09 21:23:06,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:06,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:06,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:06,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:23:06,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:06,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:06,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1085975770, now seen corresponding path program 7 times [2025-01-09 21:23:06,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625727019] [2025-01-09 21:23:06,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:06,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:06,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:06,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:06,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625727019] [2025-01-09 21:23:06,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625727019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:06,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:06,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:06,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381249167] [2025-01-09 21:23:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:06,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:06,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:06,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:07,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:07,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 367 transitions, 3311 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:07,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:07,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:07,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:08,056 INFO L124 PetriNetUnfolderBase]: 1909/6539 cut-off events. [2025-01-09 21:23:08,057 INFO L125 PetriNetUnfolderBase]: For 20656/20974 co-relation queries the response was YES. [2025-01-09 21:23:08,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23642 conditions, 6539 events. 1909/6539 cut-off events. For 20656/20974 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66790 event pairs, 85 based on Foata normal form. 44/6558 useless extension candidates. Maximal degree in co-relation 23558. Up to 1195 conditions per place. [2025-01-09 21:23:08,104 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 72 selfloop transitions, 36 changer transitions 4/398 dead transitions. [2025-01-09 21:23:08,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 398 transitions, 3833 flow [2025-01-09 21:23:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1131 transitions. [2025-01-09 21:23:08,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-01-09 21:23:08,106 INFO L175 Difference]: Start difference. First operand has 234 places, 367 transitions, 3311 flow. Second operand 13 states and 1131 transitions. [2025-01-09 21:23:08,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 398 transitions, 3833 flow [2025-01-09 21:23:08,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 398 transitions, 3751 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:08,208 INFO L231 Difference]: Finished difference. Result has 241 places, 375 transitions, 3463 flow [2025-01-09 21:23:08,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3252, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3463, PETRI_PLACES=241, PETRI_TRANSITIONS=375} [2025-01-09 21:23:08,210 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 127 predicate places. [2025-01-09 21:23:08,210 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 375 transitions, 3463 flow [2025-01-09 21:23:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:08,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:08,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:08,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:23:08,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:08,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash -937140688, now seen corresponding path program 8 times [2025-01-09 21:23:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:08,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-01-09 21:23:08,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:08,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:08,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:08,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:08,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913222141] [2025-01-09 21:23:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913222141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:08,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046524666] [2025-01-09 21:23:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:08,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:08,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:09,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:09,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 375 transitions, 3463 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:09,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:09,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:09,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:10,268 INFO L124 PetriNetUnfolderBase]: 1910/6540 cut-off events. [2025-01-09 21:23:10,268 INFO L125 PetriNetUnfolderBase]: For 22396/22768 co-relation queries the response was YES. [2025-01-09 21:23:10,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23914 conditions, 6540 events. 1910/6540 cut-off events. For 22396/22768 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66813 event pairs, 83 based on Foata normal form. 48/6563 useless extension candidates. Maximal degree in co-relation 23827. Up to 1187 conditions per place. [2025-01-09 21:23:10,309 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 73 selfloop transitions, 37 changer transitions 5/401 dead transitions. [2025-01-09 21:23:10,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 401 transitions, 3930 flow [2025-01-09 21:23:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-01-09 21:23:10,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-01-09 21:23:10,310 INFO L175 Difference]: Start difference. First operand has 241 places, 375 transitions, 3463 flow. Second operand 13 states and 1135 transitions. [2025-01-09 21:23:10,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 401 transitions, 3930 flow [2025-01-09 21:23:10,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 401 transitions, 3847 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:10,408 INFO L231 Difference]: Finished difference. Result has 249 places, 378 transitions, 3545 flow [2025-01-09 21:23:10,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3545, PETRI_PLACES=249, PETRI_TRANSITIONS=378} [2025-01-09 21:23:10,409 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 135 predicate places. [2025-01-09 21:23:10,409 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 378 transitions, 3545 flow [2025-01-09 21:23:10,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:10,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:10,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:23:10,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:10,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1553215992, now seen corresponding path program 9 times [2025-01-09 21:23:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-01-09 21:23:10,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:10,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:10,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:10,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:10,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-01-09 21:23:10,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180181491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:10,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:10,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315025846] [2025-01-09 21:23:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:10,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:10,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:10,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:11,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:11,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 378 transitions, 3545 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:11,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:11,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:11,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:11,991 INFO L124 PetriNetUnfolderBase]: 1911/6515 cut-off events. [2025-01-09 21:23:11,992 INFO L125 PetriNetUnfolderBase]: For 23505/23870 co-relation queries the response was YES. [2025-01-09 21:23:12,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24019 conditions, 6515 events. 1911/6515 cut-off events. For 23505/23870 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66525 event pairs, 88 based on Foata normal form. 40/6528 useless extension candidates. Maximal degree in co-relation 23928. Up to 1197 conditions per place. [2025-01-09 21:23:12,046 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 77 selfloop transitions, 31 changer transitions 3/397 dead transitions. [2025-01-09 21:23:12,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 397 transitions, 3963 flow [2025-01-09 21:23:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1138 transitions. [2025-01-09 21:23:12,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7886347886347886 [2025-01-09 21:23:12,048 INFO L175 Difference]: Start difference. First operand has 249 places, 378 transitions, 3545 flow. Second operand 13 states and 1138 transitions. [2025-01-09 21:23:12,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 397 transitions, 3963 flow [2025-01-09 21:23:12,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 397 transitions, 3796 flow, removed 43 selfloop flow, removed 13 redundant places. [2025-01-09 21:23:12,154 INFO L231 Difference]: Finished difference. Result has 251 places, 381 transitions, 3555 flow [2025-01-09 21:23:12,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3425, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3555, PETRI_PLACES=251, PETRI_TRANSITIONS=381} [2025-01-09 21:23:12,155 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 137 predicate places. [2025-01-09 21:23:12,155 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 381 transitions, 3555 flow [2025-01-09 21:23:12,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:12,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:12,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:12,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:23:12,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:12,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -568278840, now seen corresponding path program 1 times [2025-01-09 21:23:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:12,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-01-09 21:23:12,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:12,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:12,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:12,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:12,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:12,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-01-09 21:23:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662798246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539284758] [2025-01-09 21:23:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:12,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:12,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:12,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:12,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:12,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:12,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 381 transitions, 3555 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:12,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:12,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:12,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:13,981 INFO L124 PetriNetUnfolderBase]: 2174/7382 cut-off events. [2025-01-09 21:23:13,982 INFO L125 PetriNetUnfolderBase]: For 27449/27844 co-relation queries the response was YES. [2025-01-09 21:23:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27098 conditions, 7382 events. 2174/7382 cut-off events. For 27449/27844 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 77223 event pairs, 97 based on Foata normal form. 42/7393 useless extension candidates. Maximal degree in co-relation 27009. Up to 1365 conditions per place. [2025-01-09 21:23:14,037 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 83 selfloop transitions, 34 changer transitions 3/406 dead transitions. [2025-01-09 21:23:14,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 406 transitions, 4070 flow [2025-01-09 21:23:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-01-09 21:23:14,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-01-09 21:23:14,038 INFO L175 Difference]: Start difference. First operand has 251 places, 381 transitions, 3555 flow. Second operand 13 states and 1139 transitions. [2025-01-09 21:23:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 406 transitions, 4070 flow [2025-01-09 21:23:14,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 406 transitions, 3962 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:14,191 INFO L231 Difference]: Finished difference. Result has 258 places, 387 transitions, 3670 flow [2025-01-09 21:23:14,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3488, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3670, PETRI_PLACES=258, PETRI_TRANSITIONS=387} [2025-01-09 21:23:14,192 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 144 predicate places. [2025-01-09 21:23:14,192 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 387 transitions, 3670 flow [2025-01-09 21:23:14,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:14,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:14,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:14,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:23:14,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1069381706, now seen corresponding path program 2 times [2025-01-09 21:23:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:14,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-01-09 21:23:14,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:14,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:14,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:14,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:14,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308988073] [2025-01-09 21:23:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308988073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356981003] [2025-01-09 21:23:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:14,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:14,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:15,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:15,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 387 transitions, 3670 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:15,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:15,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:15,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:16,128 INFO L124 PetriNetUnfolderBase]: 2174/7402 cut-off events. [2025-01-09 21:23:16,129 INFO L125 PetriNetUnfolderBase]: For 27795/28190 co-relation queries the response was YES. [2025-01-09 21:23:16,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27224 conditions, 7402 events. 2174/7402 cut-off events. For 27795/28190 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 77512 event pairs, 100 based on Foata normal form. 39/7410 useless extension candidates. Maximal degree in co-relation 27132. Up to 1368 conditions per place. [2025-01-09 21:23:16,184 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 81 selfloop transitions, 31 changer transitions 5/403 dead transitions. [2025-01-09 21:23:16,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 403 transitions, 4038 flow [2025-01-09 21:23:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-01-09 21:23:16,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-01-09 21:23:16,186 INFO L175 Difference]: Start difference. First operand has 258 places, 387 transitions, 3670 flow. Second operand 13 states and 1139 transitions. [2025-01-09 21:23:16,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 403 transitions, 4038 flow [2025-01-09 21:23:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 403 transitions, 3976 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:16,317 INFO L231 Difference]: Finished difference. Result has 263 places, 387 transitions, 3691 flow [2025-01-09 21:23:16,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3691, PETRI_PLACES=263, PETRI_TRANSITIONS=387} [2025-01-09 21:23:16,318 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 149 predicate places. [2025-01-09 21:23:16,318 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 387 transitions, 3691 flow [2025-01-09 21:23:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:16,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:16,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:16,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:23:16,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:16,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1468252868, now seen corresponding path program 3 times [2025-01-09 21:23:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:16,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-01-09 21:23:16,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:16,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:16,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:16,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:16,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:16,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-01-09 21:23:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214223870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:16,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193325670] [2025-01-09 21:23:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:16,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:16,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:17,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:17,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 387 transitions, 3691 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:17,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:17,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:17,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:17,942 INFO L124 PetriNetUnfolderBase]: 1907/6560 cut-off events. [2025-01-09 21:23:17,942 INFO L125 PetriNetUnfolderBase]: For 24514/24870 co-relation queries the response was YES. [2025-01-09 21:23:17,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24089 conditions, 6560 events. 1907/6560 cut-off events. For 24514/24870 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 67339 event pairs, 87 based on Foata normal form. 35/6568 useless extension candidates. Maximal degree in co-relation 23995. Up to 1205 conditions per place. [2025-01-09 21:23:17,992 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 78 selfloop transitions, 28 changer transitions 9/401 dead transitions. [2025-01-09 21:23:17,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 401 transitions, 4001 flow [2025-01-09 21:23:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-01-09 21:23:17,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-01-09 21:23:17,993 INFO L175 Difference]: Start difference. First operand has 263 places, 387 transitions, 3691 flow. Second operand 13 states and 1135 transitions. [2025-01-09 21:23:17,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 401 transitions, 4001 flow [2025-01-09 21:23:18,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 401 transitions, 3918 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-01-09 21:23:18,110 INFO L231 Difference]: Finished difference. Result has 264 places, 381 transitions, 3574 flow [2025-01-09 21:23:18,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3540, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3574, PETRI_PLACES=264, PETRI_TRANSITIONS=381} [2025-01-09 21:23:18,110 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 150 predicate places. [2025-01-09 21:23:18,111 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 381 transitions, 3574 flow [2025-01-09 21:23:18,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:18,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:18,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:18,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:23:18,111 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:18,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1571950034, now seen corresponding path program 4 times [2025-01-09 21:23:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397347608] [2025-01-09 21:23:18,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:18,119 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:18,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:18,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:18,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397347608] [2025-01-09 21:23:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397347608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000870968] [2025-01-09 21:23:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:18,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:18,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:18,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 381 transitions, 3574 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:18,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:19,608 INFO L124 PetriNetUnfolderBase]: 1906/6525 cut-off events. [2025-01-09 21:23:19,608 INFO L125 PetriNetUnfolderBase]: For 24014/24364 co-relation queries the response was YES. [2025-01-09 21:23:19,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23866 conditions, 6525 events. 1906/6525 cut-off events. For 24014/24364 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 66743 event pairs, 88 based on Foata normal form. 37/6535 useless extension candidates. Maximal degree in co-relation 23771. Up to 1193 conditions per place. [2025-01-09 21:23:19,660 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 74 selfloop transitions, 31 changer transitions 5/396 dead transitions. [2025-01-09 21:23:19,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 396 transitions, 3935 flow [2025-01-09 21:23:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1138 transitions. [2025-01-09 21:23:19,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7886347886347886 [2025-01-09 21:23:19,661 INFO L175 Difference]: Start difference. First operand has 264 places, 381 transitions, 3574 flow. Second operand 13 states and 1138 transitions. [2025-01-09 21:23:19,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 396 transitions, 3935 flow [2025-01-09 21:23:19,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 396 transitions, 3841 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-01-09 21:23:19,768 INFO L231 Difference]: Finished difference. Result has 258 places, 381 transitions, 3570 flow [2025-01-09 21:23:19,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3501, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3570, PETRI_PLACES=258, PETRI_TRANSITIONS=381} [2025-01-09 21:23:19,769 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 144 predicate places. [2025-01-09 21:23:19,769 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 381 transitions, 3570 flow [2025-01-09 21:23:19,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:19,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:19,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:23:19,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1891756424, now seen corresponding path program 5 times [2025-01-09 21:23:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966366340] [2025-01-09 21:23:19,771 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:19,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:19,782 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:19,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:19,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:19,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:19,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966366340] [2025-01-09 21:23:19,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966366340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:19,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753661785] [2025-01-09 21:23:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:19,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:19,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:19,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:20,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:20,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 381 transitions, 3570 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:20,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:20,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:20,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:21,242 INFO L124 PetriNetUnfolderBase]: 1637/5683 cut-off events. [2025-01-09 21:23:21,243 INFO L125 PetriNetUnfolderBase]: For 20287/20597 co-relation queries the response was YES. [2025-01-09 21:23:21,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20722 conditions, 5683 events. 1637/5683 cut-off events. For 20287/20597 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 56561 event pairs, 77 based on Foata normal form. 30/5690 useless extension candidates. Maximal degree in co-relation 20630. Up to 1032 conditions per place. [2025-01-09 21:23:21,285 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 70 selfloop transitions, 23 changer transitions 10/389 dead transitions. [2025-01-09 21:23:21,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 389 transitions, 3794 flow [2025-01-09 21:23:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1134 transitions. [2025-01-09 21:23:21,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7858627858627859 [2025-01-09 21:23:21,287 INFO L175 Difference]: Start difference. First operand has 258 places, 381 transitions, 3570 flow. Second operand 13 states and 1134 transitions. [2025-01-09 21:23:21,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 389 transitions, 3794 flow [2025-01-09 21:23:21,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 389 transitions, 3691 flow, removed 10 selfloop flow, removed 14 redundant places. [2025-01-09 21:23:21,394 INFO L231 Difference]: Finished difference. Result has 255 places, 371 transitions, 3372 flow [2025-01-09 21:23:21,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3372, PETRI_PLACES=255, PETRI_TRANSITIONS=371} [2025-01-09 21:23:21,395 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 141 predicate places. [2025-01-09 21:23:21,396 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 371 transitions, 3372 flow [2025-01-09 21:23:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:21,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:21,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:21,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:23:21,396 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:21,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1619751972, now seen corresponding path program 6 times [2025-01-09 21:23:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:21,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16424824] [2025-01-09 21:23:21,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:21,406 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:21,410 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:21,410 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:21,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16424824] [2025-01-09 21:23:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16424824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160353192] [2025-01-09 21:23:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:21,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:21,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:22,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:22,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 371 transitions, 3372 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:22,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:22,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:22,890 INFO L124 PetriNetUnfolderBase]: 1367/4796 cut-off events. [2025-01-09 21:23:22,890 INFO L125 PetriNetUnfolderBase]: For 15450/15683 co-relation queries the response was YES. [2025-01-09 21:23:22,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17258 conditions, 4796 events. 1367/4796 cut-off events. For 15450/15683 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 45992 event pairs, 58 based on Foata normal form. 35/4812 useless extension candidates. Maximal degree in co-relation 17193. Up to 871 conditions per place. [2025-01-09 21:23:22,932 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 66 selfloop transitions, 26 changer transitions 8/386 dead transitions. [2025-01-09 21:23:22,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 386 transitions, 3618 flow [2025-01-09 21:23:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1127 transitions. [2025-01-09 21:23:22,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781011781011781 [2025-01-09 21:23:22,934 INFO L175 Difference]: Start difference. First operand has 255 places, 371 transitions, 3372 flow. Second operand 13 states and 1127 transitions. [2025-01-09 21:23:22,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 386 transitions, 3618 flow [2025-01-09 21:23:23,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 386 transitions, 3523 flow, removed 10 selfloop flow, removed 15 redundant places. [2025-01-09 21:23:23,013 INFO L231 Difference]: Finished difference. Result has 245 places, 365 transitions, 3246 flow [2025-01-09 21:23:23,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3246, PETRI_PLACES=245, PETRI_TRANSITIONS=365} [2025-01-09 21:23:23,014 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 131 predicate places. [2025-01-09 21:23:23,014 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 365 transitions, 3246 flow [2025-01-09 21:23:23,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:23,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:23,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:23:23,015 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:23,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash 791919810, now seen corresponding path program 7 times [2025-01-09 21:23:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392377231] [2025-01-09 21:23:23,015 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:23,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:23,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:23,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392377231] [2025-01-09 21:23:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392377231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587885377] [2025-01-09 21:23:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:23,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:23,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:23,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:23,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 365 transitions, 3246 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:23,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:23,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:23,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:24,452 INFO L124 PetriNetUnfolderBase]: 1367/4809 cut-off events. [2025-01-09 21:23:24,452 INFO L125 PetriNetUnfolderBase]: For 14509/14755 co-relation queries the response was YES. [2025-01-09 21:23:24,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17108 conditions, 4809 events. 1367/4809 cut-off events. For 14509/14755 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 46089 event pairs, 60 based on Foata normal form. 35/4825 useless extension candidates. Maximal degree in co-relation 17045. Up to 858 conditions per place. [2025-01-09 21:23:24,492 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 63 selfloop transitions, 28 changer transitions 4/381 dead transitions. [2025-01-09 21:23:24,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 381 transitions, 3548 flow [2025-01-09 21:23:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1131 transitions. [2025-01-09 21:23:24,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-01-09 21:23:24,493 INFO L175 Difference]: Start difference. First operand has 245 places, 365 transitions, 3246 flow. Second operand 13 states and 1131 transitions. [2025-01-09 21:23:24,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 381 transitions, 3548 flow [2025-01-09 21:23:24,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 381 transitions, 3434 flow, removed 17 selfloop flow, removed 16 redundant places. [2025-01-09 21:23:24,563 INFO L231 Difference]: Finished difference. Result has 239 places, 365 transitions, 3223 flow [2025-01-09 21:23:24,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3223, PETRI_PLACES=239, PETRI_TRANSITIONS=365} [2025-01-09 21:23:24,564 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 125 predicate places. [2025-01-09 21:23:24,564 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 365 transitions, 3223 flow [2025-01-09 21:23:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:24,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:24,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:24,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:23:24,565 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:24,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -91655010, now seen corresponding path program 8 times [2025-01-09 21:23:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-01-09 21:23:24,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:24,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:24,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:24,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-01-09 21:23:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53091607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481112241] [2025-01-09 21:23:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:24,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:24,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:25,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:25,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 365 transitions, 3223 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:25,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:25,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:25,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:25,933 INFO L124 PetriNetUnfolderBase]: 1365/4784 cut-off events. [2025-01-09 21:23:25,933 INFO L125 PetriNetUnfolderBase]: For 14143/14373 co-relation queries the response was YES. [2025-01-09 21:23:25,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16957 conditions, 4784 events. 1365/4784 cut-off events. For 14143/14373 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 45792 event pairs, 61 based on Foata normal form. 34/4799 useless extension candidates. Maximal degree in co-relation 16897. Up to 861 conditions per place. [2025-01-09 21:23:25,967 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 60 selfloop transitions, 30 changer transitions 5/381 dead transitions. [2025-01-09 21:23:25,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 381 transitions, 3522 flow [2025-01-09 21:23:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1130 transitions. [2025-01-09 21:23:25,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830907830907831 [2025-01-09 21:23:25,968 INFO L175 Difference]: Start difference. First operand has 239 places, 365 transitions, 3223 flow. Second operand 13 states and 1130 transitions. [2025-01-09 21:23:25,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 381 transitions, 3522 flow [2025-01-09 21:23:26,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 381 transitions, 3452 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-01-09 21:23:26,037 INFO L231 Difference]: Finished difference. Result has 242 places, 366 transitions, 3255 flow [2025-01-09 21:23:26,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3163, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3255, PETRI_PLACES=242, PETRI_TRANSITIONS=366} [2025-01-09 21:23:26,038 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 128 predicate places. [2025-01-09 21:23:26,039 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 366 transitions, 3255 flow [2025-01-09 21:23:26,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:26,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:26,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:26,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:23:26,039 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:26,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash 768534790, now seen corresponding path program 9 times [2025-01-09 21:23:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:26,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-01-09 21:23:26,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:26,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:26,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:26,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:26,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:26,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-01-09 21:23:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314631517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171448825] [2025-01-09 21:23:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:26,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:26,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:26,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:26,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 366 transitions, 3255 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:26,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:26,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:26,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:27,383 INFO L124 PetriNetUnfolderBase]: 1096/3968 cut-off events. [2025-01-09 21:23:27,384 INFO L125 PetriNetUnfolderBase]: For 11458/11646 co-relation queries the response was YES. [2025-01-09 21:23:27,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13959 conditions, 3968 events. 1096/3968 cut-off events. For 11458/11646 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 36392 event pairs, 50 based on Foata normal form. 28/3981 useless extension candidates. Maximal degree in co-relation 13896. Up to 697 conditions per place. [2025-01-09 21:23:27,415 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 55 selfloop transitions, 21 changer transitions 12/374 dead transitions. [2025-01-09 21:23:27,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 374 transitions, 3435 flow [2025-01-09 21:23:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1126 transitions. [2025-01-09 21:23:27,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7803187803187803 [2025-01-09 21:23:27,416 INFO L175 Difference]: Start difference. First operand has 242 places, 366 transitions, 3255 flow. Second operand 13 states and 1126 transitions. [2025-01-09 21:23:27,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 374 transitions, 3435 flow [2025-01-09 21:23:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 374 transitions, 3374 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-01-09 21:23:27,475 INFO L231 Difference]: Finished difference. Result has 243 places, 355 transitions, 3100 flow [2025-01-09 21:23:27,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3128, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3100, PETRI_PLACES=243, PETRI_TRANSITIONS=355} [2025-01-09 21:23:27,476 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 129 predicate places. [2025-01-09 21:23:27,476 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 355 transitions, 3100 flow [2025-01-09 21:23:27,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:27,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:27,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:23:27,476 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1247688722, now seen corresponding path program 10 times [2025-01-09 21:23:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085349321] [2025-01-09 21:23:27,477 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:27,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:27,487 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:27,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085349321] [2025-01-09 21:23:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085349321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703985309] [2025-01-09 21:23:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:27,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:27,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:27,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:28,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:28,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 355 transitions, 3100 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:28,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:28,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:28,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:28,823 INFO L124 PetriNetUnfolderBase]: 1358/4648 cut-off events. [2025-01-09 21:23:28,823 INFO L125 PetriNetUnfolderBase]: For 13514/13767 co-relation queries the response was YES. [2025-01-09 21:23:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16325 conditions, 4648 events. 1358/4648 cut-off events. For 13514/13767 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 44423 event pairs, 56 based on Foata normal form. 30/4659 useless extension candidates. Maximal degree in co-relation 16263. Up to 843 conditions per place. [2025-01-09 21:23:28,847 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 54 selfloop transitions, 36 changer transitions 1/377 dead transitions. [2025-01-09 21:23:28,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 377 transitions, 3445 flow [2025-01-09 21:23:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-01-09 21:23:28,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-01-09 21:23:28,849 INFO L175 Difference]: Start difference. First operand has 243 places, 355 transitions, 3100 flow. Second operand 13 states and 1135 transitions. [2025-01-09 21:23:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 377 transitions, 3445 flow [2025-01-09 21:23:28,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 377 transitions, 3320 flow, removed 18 selfloop flow, removed 19 redundant places. [2025-01-09 21:23:28,908 INFO L231 Difference]: Finished difference. Result has 230 places, 362 transitions, 3174 flow [2025-01-09 21:23:28,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3174, PETRI_PLACES=230, PETRI_TRANSITIONS=362} [2025-01-09 21:23:28,908 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 116 predicate places. [2025-01-09 21:23:28,908 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 362 transitions, 3174 flow [2025-01-09 21:23:28,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:28,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:28,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:23:28,909 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 160235840, now seen corresponding path program 11 times [2025-01-09 21:23:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235126515] [2025-01-09 21:23:28,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:28,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:28,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:28,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235126515] [2025-01-09 21:23:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235126515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804582156] [2025-01-09 21:23:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:29,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:29,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:29,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:29,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 362 transitions, 3174 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:29,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:29,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:29,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:30,213 INFO L124 PetriNetUnfolderBase]: 1356/4628 cut-off events. [2025-01-09 21:23:30,213 INFO L125 PetriNetUnfolderBase]: For 13710/13952 co-relation queries the response was YES. [2025-01-09 21:23:30,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16316 conditions, 4628 events. 1356/4628 cut-off events. For 13710/13952 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 44183 event pairs, 57 based on Foata normal form. 51/4660 useless extension candidates. Maximal degree in co-relation 16259. Up to 853 conditions per place. [2025-01-09 21:23:30,248 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 40 selfloop transitions, 51 changer transitions 3/380 dead transitions. [2025-01-09 21:23:30,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 380 transitions, 3474 flow [2025-01-09 21:23:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-01-09 21:23:30,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-01-09 21:23:30,249 INFO L175 Difference]: Start difference. First operand has 230 places, 362 transitions, 3174 flow. Second operand 13 states and 1122 transitions. [2025-01-09 21:23:30,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 380 transitions, 3474 flow [2025-01-09 21:23:30,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 380 transitions, 3410 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:30,315 INFO L231 Difference]: Finished difference. Result has 236 places, 361 transitions, 3224 flow [2025-01-09 21:23:30,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3224, PETRI_PLACES=236, PETRI_TRANSITIONS=361} [2025-01-09 21:23:30,315 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 122 predicate places. [2025-01-09 21:23:30,316 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 361 transitions, 3224 flow [2025-01-09 21:23:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:30,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:30,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:23:30,316 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 927882332, now seen corresponding path program 12 times [2025-01-09 21:23:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-01-09 21:23:30,317 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:30,326 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:30,328 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:30,328 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:30,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-01-09 21:23:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779146364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982427560] [2025-01-09 21:23:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:30,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:31,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:31,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 361 transitions, 3224 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:31,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:31,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:31,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:31,635 INFO L124 PetriNetUnfolderBase]: 1088/3839 cut-off events. [2025-01-09 21:23:31,635 INFO L125 PetriNetUnfolderBase]: For 11591/11791 co-relation queries the response was YES. [2025-01-09 21:23:31,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13643 conditions, 3839 events. 1088/3839 cut-off events. For 11591/11791 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 35159 event pairs, 47 based on Foata normal form. 21/3845 useless extension candidates. Maximal degree in co-relation 13584. Up to 687 conditions per place. [2025-01-09 21:23:31,661 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 52 selfloop transitions, 28 changer transitions 6/372 dead transitions. [2025-01-09 21:23:31,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 372 transitions, 3436 flow [2025-01-09 21:23:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1130 transitions. [2025-01-09 21:23:31,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830907830907831 [2025-01-09 21:23:31,662 INFO L175 Difference]: Start difference. First operand has 236 places, 361 transitions, 3224 flow. Second operand 13 states and 1130 transitions. [2025-01-09 21:23:31,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 372 transitions, 3436 flow [2025-01-09 21:23:31,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 372 transitions, 3353 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-01-09 21:23:31,714 INFO L231 Difference]: Finished difference. Result has 237 places, 354 transitions, 3115 flow [2025-01-09 21:23:31,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3091, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3115, PETRI_PLACES=237, PETRI_TRANSITIONS=354} [2025-01-09 21:23:31,718 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 123 predicate places. [2025-01-09 21:23:31,719 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 354 transitions, 3115 flow [2025-01-09 21:23:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:31,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:31,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:31,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:23:31,720 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:31,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1537220490, now seen corresponding path program 13 times [2025-01-09 21:23:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891752481] [2025-01-09 21:23:31,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:31,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:31,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:31,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:31,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:31,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:31,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:31,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891752481] [2025-01-09 21:23:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891752481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412330264] [2025-01-09 21:23:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:32,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:32,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 354 transitions, 3115 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:32,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:32,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:32,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:32,959 INFO L124 PetriNetUnfolderBase]: 1085/3828 cut-off events. [2025-01-09 21:23:32,960 INFO L125 PetriNetUnfolderBase]: For 11295/11481 co-relation queries the response was YES. [2025-01-09 21:23:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13518 conditions, 3828 events. 1085/3828 cut-off events. For 11295/11481 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 35019 event pairs, 45 based on Foata normal form. 26/3839 useless extension candidates. Maximal degree in co-relation 13459. Up to 683 conditions per place. [2025-01-09 21:23:32,986 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 51 selfloop transitions, 37 changer transitions 2/376 dead transitions. [2025-01-09 21:23:32,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 376 transitions, 3444 flow [2025-01-09 21:23:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1125 transitions. [2025-01-09 21:23:32,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7796257796257796 [2025-01-09 21:23:32,987 INFO L175 Difference]: Start difference. First operand has 237 places, 354 transitions, 3115 flow. Second operand 13 states and 1125 transitions. [2025-01-09 21:23:32,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 376 transitions, 3444 flow [2025-01-09 21:23:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 376 transitions, 3365 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-01-09 21:23:33,041 INFO L231 Difference]: Finished difference. Result has 234 places, 357 transitions, 3183 flow [2025-01-09 21:23:33,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3048, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3183, PETRI_PLACES=234, PETRI_TRANSITIONS=357} [2025-01-09 21:23:33,042 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 120 predicate places. [2025-01-09 21:23:33,042 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 357 transitions, 3183 flow [2025-01-09 21:23:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:33,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:33,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:23:33,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1561646848, now seen corresponding path program 14 times [2025-01-09 21:23:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134420241] [2025-01-09 21:23:33,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:33,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:33,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:33,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134420241] [2025-01-09 21:23:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134420241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:33,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:33,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289080800] [2025-01-09 21:23:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:33,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:33,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:33,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:33,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:33,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 357 transitions, 3183 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:33,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:33,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:34,199 INFO L124 PetriNetUnfolderBase]: 817/2991 cut-off events. [2025-01-09 21:23:34,199 INFO L125 PetriNetUnfolderBase]: For 8743/8881 co-relation queries the response was YES. [2025-01-09 21:23:34,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10571 conditions, 2991 events. 817/2991 cut-off events. For 8743/8881 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 25899 event pairs, 34 based on Foata normal form. 22/3002 useless extension candidates. Maximal degree in co-relation 10511. Up to 521 conditions per place. [2025-01-09 21:23:34,214 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 41 selfloop transitions, 36 changer transitions 8/351 dead transitions. [2025-01-09 21:23:34,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 351 transitions, 3102 flow [2025-01-09 21:23:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-01-09 21:23:34,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-01-09 21:23:34,215 INFO L175 Difference]: Start difference. First operand has 234 places, 357 transitions, 3183 flow. Second operand 13 states and 1123 transitions. [2025-01-09 21:23:34,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 351 transitions, 3102 flow [2025-01-09 21:23:34,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 351 transitions, 3034 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-01-09 21:23:34,250 INFO L231 Difference]: Finished difference. Result has 237 places, 329 transitions, 2822 flow [2025-01-09 21:23:34,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2764, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2822, PETRI_PLACES=237, PETRI_TRANSITIONS=329} [2025-01-09 21:23:34,250 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 123 predicate places. [2025-01-09 21:23:34,250 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 329 transitions, 2822 flow [2025-01-09 21:23:34,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:34,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:34,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:23:34,251 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1599082624, now seen corresponding path program 15 times [2025-01-09 21:23:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-01-09 21:23:34,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:34,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:34,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:34,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:34,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960545268] [2025-01-09 21:23:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960545268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444872044] [2025-01-09 21:23:34,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:34,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:34,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:34,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:34,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 329 transitions, 2822 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:34,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:35,324 INFO L124 PetriNetUnfolderBase]: 554/2141 cut-off events. [2025-01-09 21:23:35,324 INFO L125 PetriNetUnfolderBase]: For 5759/5864 co-relation queries the response was YES. [2025-01-09 21:23:35,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7407 conditions, 2141 events. 554/2141 cut-off events. For 5759/5864 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16924 event pairs, 24 based on Foata normal form. 7/2140 useless extension candidates. Maximal degree in co-relation 7346. Up to 355 conditions per place. [2025-01-09 21:23:35,339 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 39 selfloop transitions, 20 changer transitions 8/289 dead transitions. [2025-01-09 21:23:35,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 289 transitions, 2287 flow [2025-01-09 21:23:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-01-09 21:23:35,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-01-09 21:23:35,340 INFO L175 Difference]: Start difference. First operand has 237 places, 329 transitions, 2822 flow. Second operand 13 states and 1115 transitions. [2025-01-09 21:23:35,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 289 transitions, 2287 flow [2025-01-09 21:23:35,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 289 transitions, 2116 flow, removed 53 selfloop flow, removed 28 redundant places. [2025-01-09 21:23:35,368 INFO L231 Difference]: Finished difference. Result has 209 places, 268 transitions, 1901 flow [2025-01-09 21:23:35,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1901, PETRI_PLACES=209, PETRI_TRANSITIONS=268} [2025-01-09 21:23:35,369 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 95 predicate places. [2025-01-09 21:23:35,369 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 268 transitions, 1901 flow [2025-01-09 21:23:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:35,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:35,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:35,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:23:35,370 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:35,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash -800481570, now seen corresponding path program 16 times [2025-01-09 21:23:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715165411] [2025-01-09 21:23:35,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:35,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:35,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:35,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:35,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715165411] [2025-01-09 21:23:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715165411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:23:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849453087] [2025-01-09 21:23:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:23:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:35,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:23:35,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:23:36,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-01-09 21:23:36,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 268 transitions, 1901 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:36,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:36,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-01-09 21:23:36,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:37,019 INFO L124 PetriNetUnfolderBase]: 1178/3689 cut-off events. [2025-01-09 21:23:37,020 INFO L125 PetriNetUnfolderBase]: For 12006/12265 co-relation queries the response was YES. [2025-01-09 21:23:37,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 3689 events. 1178/3689 cut-off events. For 12006/12265 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 31020 event pairs, 100 based on Foata normal form. 71/3737 useless extension candidates. Maximal degree in co-relation 13795. Up to 648 conditions per place. [2025-01-09 21:23:37,082 INFO L140 encePairwiseOnDemand]: 88/111 looper letters, 447 selfloop transitions, 112 changer transitions 34/688 dead transitions. [2025-01-09 21:23:37,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 688 transitions, 6797 flow [2025-01-09 21:23:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1569 transitions. [2025-01-09 21:23:37,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7439544807965861 [2025-01-09 21:23:37,085 INFO L175 Difference]: Start difference. First operand has 209 places, 268 transitions, 1901 flow. Second operand 19 states and 1569 transitions. [2025-01-09 21:23:37,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 688 transitions, 6797 flow [2025-01-09 21:23:37,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 688 transitions, 6661 flow, removed 9 selfloop flow, removed 14 redundant places. [2025-01-09 21:23:37,117 INFO L231 Difference]: Finished difference. Result has 214 places, 356 transitions, 3174 flow [2025-01-09 21:23:37,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3174, PETRI_PLACES=214, PETRI_TRANSITIONS=356} [2025-01-09 21:23:37,118 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places. [2025-01-09 21:23:37,118 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 356 transitions, 3174 flow [2025-01-09 21:23:37,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:37,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:37,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:23:37,119 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:37,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash 241982272, now seen corresponding path program 17 times [2025-01-09 21:23:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-01-09 21:23:37,120 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:37,125 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:37,128 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:37,128 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:37,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-01-09 21:23:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310293470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367552720] [2025-01-09 21:23:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:37,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:37,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:37,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:37,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 356 transitions, 3174 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:37,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:37,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:37,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:38,162 INFO L124 PetriNetUnfolderBase]: 872/3064 cut-off events. [2025-01-09 21:23:38,162 INFO L125 PetriNetUnfolderBase]: For 9144/9310 co-relation queries the response was YES. [2025-01-09 21:23:38,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10919 conditions, 3064 events. 872/3064 cut-off events. For 9144/9310 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 26487 event pairs, 35 based on Foata normal form. 27/3081 useless extension candidates. Maximal degree in co-relation 10869. Up to 536 conditions per place. [2025-01-09 21:23:38,182 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 36 selfloop transitions, 33 changer transitions 10/371 dead transitions. [2025-01-09 21:23:38,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 371 transitions, 3418 flow [2025-01-09 21:23:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-01-09 21:23:38,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-01-09 21:23:38,183 INFO L175 Difference]: Start difference. First operand has 214 places, 356 transitions, 3174 flow. Second operand 13 states and 1122 transitions. [2025-01-09 21:23:38,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 371 transitions, 3418 flow [2025-01-09 21:23:38,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 371 transitions, 3357 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-01-09 21:23:38,221 INFO L231 Difference]: Finished difference. Result has 221 places, 350 transitions, 3123 flow [2025-01-09 21:23:38,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3115, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3123, PETRI_PLACES=221, PETRI_TRANSITIONS=350} [2025-01-09 21:23:38,222 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 107 predicate places. [2025-01-09 21:23:38,222 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 350 transitions, 3123 flow [2025-01-09 21:23:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:38,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:38,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:23:38,223 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1832667520, now seen corresponding path program 1 times [2025-01-09 21:23:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479782] [2025-01-09 21:23:38,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:38,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041479782] [2025-01-09 21:23:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041479782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:38,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917396610] [2025-01-09 21:23:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:38,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:38,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:38,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:38,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:38,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 350 transitions, 3123 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:38,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:38,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:39,330 INFO L124 PetriNetUnfolderBase]: 552/2095 cut-off events. [2025-01-09 21:23:39,331 INFO L125 PetriNetUnfolderBase]: For 5940/6053 co-relation queries the response was YES. [2025-01-09 21:23:39,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 2095 events. 552/2095 cut-off events. For 5940/6053 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16491 event pairs, 24 based on Foata normal form. 13/2102 useless extension candidates. Maximal degree in co-relation 7252. Up to 353 conditions per place. [2025-01-09 21:23:39,346 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 34 selfloop transitions, 22 changer transitions 6/307 dead transitions. [2025-01-09 21:23:39,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 307 transitions, 2612 flow [2025-01-09 21:23:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-01-09 21:23:39,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-01-09 21:23:39,347 INFO L175 Difference]: Start difference. First operand has 221 places, 350 transitions, 3123 flow. Second operand 13 states and 1121 transitions. [2025-01-09 21:23:39,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 307 transitions, 2612 flow [2025-01-09 21:23:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 307 transitions, 2491 flow, removed 35 selfloop flow, removed 17 redundant places. [2025-01-09 21:23:39,382 INFO L231 Difference]: Finished difference. Result has 209 places, 292 transitions, 2316 flow [2025-01-09 21:23:39,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2316, PETRI_PLACES=209, PETRI_TRANSITIONS=292} [2025-01-09 21:23:39,386 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 95 predicate places. [2025-01-09 21:23:39,386 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 292 transitions, 2316 flow [2025-01-09 21:23:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:39,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:23:39,386 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,387 INFO L85 PathProgramCache]: Analyzing trace with hash 561788662, now seen corresponding path program 18 times [2025-01-09 21:23:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076832557] [2025-01-09 21:23:39,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,398 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:39,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:39,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:39,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076832557] [2025-01-09 21:23:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076832557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333293873] [2025-01-09 21:23:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:39,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:39,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:40,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:40,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 292 transitions, 2316 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:40,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:40,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:40,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:40,361 INFO L124 PetriNetUnfolderBase]: 281/1213 cut-off events. [2025-01-09 21:23:40,361 INFO L125 PetriNetUnfolderBase]: For 2609/2676 co-relation queries the response was YES. [2025-01-09 21:23:40,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1213 events. 281/1213 cut-off events. For 2609/2676 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8072 event pairs, 14 based on Foata normal form. 8/1218 useless extension candidates. Maximal degree in co-relation 3857. Up to 185 conditions per place. [2025-01-09 21:23:40,366 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 27 selfloop transitions, 13 changer transitions 14/280 dead transitions. [2025-01-09 21:23:40,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 280 transitions, 2133 flow [2025-01-09 21:23:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-01-09 21:23:40,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-01-09 21:23:40,367 INFO L175 Difference]: Start difference. First operand has 209 places, 292 transitions, 2316 flow. Second operand 13 states and 1115 transitions. [2025-01-09 21:23:40,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 280 transitions, 2133 flow [2025-01-09 21:23:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 280 transitions, 2062 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-01-09 21:23:40,379 INFO L231 Difference]: Finished difference. Result has 201 places, 258 transitions, 1841 flow [2025-01-09 21:23:40,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1841, PETRI_PLACES=201, PETRI_TRANSITIONS=258} [2025-01-09 21:23:40,380 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 87 predicate places. [2025-01-09 21:23:40,380 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 258 transitions, 1841 flow [2025-01-09 21:23:40,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:40,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:40,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:23:40,380 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash -808000192, now seen corresponding path program 19 times [2025-01-09 21:23:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-01-09 21:23:40,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:40,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:40,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:40,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:40,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457310660] [2025-01-09 21:23:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457310660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354305394] [2025-01-09 21:23:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:40,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:40,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:40,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:41,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:41,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 258 transitions, 1841 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:41,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:41,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:41,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:41,440 INFO L124 PetriNetUnfolderBase]: 284/1251 cut-off events. [2025-01-09 21:23:41,440 INFO L125 PetriNetUnfolderBase]: For 2562/2605 co-relation queries the response was YES. [2025-01-09 21:23:41,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 1251 events. 284/1251 cut-off events. For 2562/2605 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8574 event pairs, 18 based on Foata normal form. 9/1258 useless extension candidates. Maximal degree in co-relation 3931. Up to 207 conditions per place. [2025-01-09 21:23:41,445 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 29 selfloop transitions, 15 changer transitions 19/287 dead transitions. [2025-01-09 21:23:41,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 287 transitions, 2168 flow [2025-01-09 21:23:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-01-09 21:23:41,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-01-09 21:23:41,446 INFO L175 Difference]: Start difference. First operand has 201 places, 258 transitions, 1841 flow. Second operand 13 states and 1123 transitions. [2025-01-09 21:23:41,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 287 transitions, 2168 flow [2025-01-09 21:23:41,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 287 transitions, 1982 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-01-09 21:23:41,458 INFO L231 Difference]: Finished difference. Result has 185 places, 255 transitions, 1777 flow [2025-01-09 21:23:41,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1777, PETRI_PLACES=185, PETRI_TRANSITIONS=255} [2025-01-09 21:23:41,459 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 71 predicate places. [2025-01-09 21:23:41,459 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 255 transitions, 1777 flow [2025-01-09 21:23:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:41,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:41,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:23:41,459 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 436745674, now seen corresponding path program 20 times [2025-01-09 21:23:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891441295] [2025-01-09 21:23:41,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:41,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:41,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:41,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:41,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891441295] [2025-01-09 21:23:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891441295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:41,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716194013] [2025-01-09 21:23:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:41,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:41,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:42,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:42,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 255 transitions, 1777 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:42,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:42,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:42,334 INFO L124 PetriNetUnfolderBase]: 527/1966 cut-off events. [2025-01-09 21:23:42,334 INFO L125 PetriNetUnfolderBase]: For 3861/3962 co-relation queries the response was YES. [2025-01-09 21:23:42,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6236 conditions, 1966 events. 527/1966 cut-off events. For 3861/3962 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15113 event pairs, 21 based on Foata normal form. 11/1972 useless extension candidates. Maximal degree in co-relation 6198. Up to 341 conditions per place. [2025-01-09 21:23:42,343 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 28 selfloop transitions, 22 changer transitions 2/276 dead transitions. [2025-01-09 21:23:42,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 276 transitions, 1978 flow [2025-01-09 21:23:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1117 transitions. [2025-01-09 21:23:42,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.774081774081774 [2025-01-09 21:23:42,344 INFO L175 Difference]: Start difference. First operand has 185 places, 255 transitions, 1777 flow. Second operand 13 states and 1117 transitions. [2025-01-09 21:23:42,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 276 transitions, 1978 flow [2025-01-09 21:23:42,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 276 transitions, 1912 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-09 21:23:42,359 INFO L231 Difference]: Finished difference. Result has 185 places, 261 transitions, 1837 flow [2025-01-09 21:23:42,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1837, PETRI_PLACES=185, PETRI_TRANSITIONS=261} [2025-01-09 21:23:42,360 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 71 predicate places. [2025-01-09 21:23:42,360 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 261 transitions, 1837 flow [2025-01-09 21:23:42,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:42,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:42,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:23:42,360 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2007155008, now seen corresponding path program 10 times [2025-01-09 21:23:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:42,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643212974] [2025-01-09 21:23:42,361 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:42,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:42,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:42,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:42,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643212974] [2025-01-09 21:23:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643212974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165515056] [2025-01-09 21:23:42,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:42,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:42,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:43,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:43,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 261 transitions, 1837 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:43,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:43,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:43,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:43,396 INFO L124 PetriNetUnfolderBase]: 800/2898 cut-off events. [2025-01-09 21:23:43,397 INFO L125 PetriNetUnfolderBase]: For 6176/6306 co-relation queries the response was YES. [2025-01-09 21:23:43,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 2898 events. 800/2898 cut-off events. For 6176/6306 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 24845 event pairs, 36 based on Foata normal form. 16/2908 useless extension candidates. Maximal degree in co-relation 9397. Up to 536 conditions per place. [2025-01-09 21:23:43,411 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 39 selfloop transitions, 20 changer transitions 7/290 dead transitions. [2025-01-09 21:23:43,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 290 transitions, 2133 flow [2025-01-09 21:23:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-01-09 21:23:43,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-01-09 21:23:43,412 INFO L175 Difference]: Start difference. First operand has 185 places, 261 transitions, 1837 flow. Second operand 13 states and 1121 transitions. [2025-01-09 21:23:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 290 transitions, 2133 flow [2025-01-09 21:23:43,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 290 transitions, 2076 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:43,434 INFO L231 Difference]: Finished difference. Result has 192 places, 267 transitions, 1914 flow [2025-01-09 21:23:43,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1914, PETRI_PLACES=192, PETRI_TRANSITIONS=267} [2025-01-09 21:23:43,435 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 78 predicate places. [2025-01-09 21:23:43,435 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 267 transitions, 1914 flow [2025-01-09 21:23:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:43,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:43,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:43,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:23:43,436 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:43,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1894790072, now seen corresponding path program 11 times [2025-01-09 21:23:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-01-09 21:23:43,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:43,442 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:43,445 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:43,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-01-09 21:23:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049756032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717824443] [2025-01-09 21:23:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:43,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:43,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:44,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:44,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 267 transitions, 1914 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:44,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:44,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:44,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:44,473 INFO L124 PetriNetUnfolderBase]: 1066/3727 cut-off events. [2025-01-09 21:23:44,473 INFO L125 PetriNetUnfolderBase]: For 8777/8995 co-relation queries the response was YES. [2025-01-09 21:23:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 3727 events. 1066/3727 cut-off events. For 8777/8995 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 33748 event pairs, 44 based on Foata normal form. 18/3736 useless extension candidates. Maximal degree in co-relation 12340. Up to 687 conditions per place. [2025-01-09 21:23:44,495 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 35 selfloop transitions, 27 changer transitions 3/289 dead transitions. [2025-01-09 21:23:44,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 289 transitions, 2193 flow [2025-01-09 21:23:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-01-09 21:23:44,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-01-09 21:23:44,496 INFO L175 Difference]: Start difference. First operand has 192 places, 267 transitions, 1914 flow. Second operand 13 states and 1121 transitions. [2025-01-09 21:23:44,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 289 transitions, 2193 flow [2025-01-09 21:23:44,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 289 transitions, 2141 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:44,527 INFO L231 Difference]: Finished difference. Result has 198 places, 275 transitions, 2029 flow [2025-01-09 21:23:44,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2029, PETRI_PLACES=198, PETRI_TRANSITIONS=275} [2025-01-09 21:23:44,528 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 84 predicate places. [2025-01-09 21:23:44,528 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 275 transitions, 2029 flow [2025-01-09 21:23:44,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:44,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:44,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:44,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:23:44,529 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:44,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash -916589858, now seen corresponding path program 12 times [2025-01-09 21:23:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:44,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355576698] [2025-01-09 21:23:44,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:44,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:44,538 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:44,538 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355576698] [2025-01-09 21:23:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355576698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773619789] [2025-01-09 21:23:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:44,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:44,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:44,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:45,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:45,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 275 transitions, 2029 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:45,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:45,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:45,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:45,720 INFO L124 PetriNetUnfolderBase]: 1341/4672 cut-off events. [2025-01-09 21:23:45,720 INFO L125 PetriNetUnfolderBase]: For 11944/12216 co-relation queries the response was YES. [2025-01-09 21:23:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15860 conditions, 4672 events. 1341/4672 cut-off events. For 11944/12216 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 44417 event pairs, 66 based on Foata normal form. 23/4684 useless extension candidates. Maximal degree in co-relation 15815. Up to 865 conditions per place. [2025-01-09 21:23:45,745 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 50 selfloop transitions, 25 changer transitions 6/305 dead transitions. [2025-01-09 21:23:45,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 305 transitions, 2414 flow [2025-01-09 21:23:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1127 transitions. [2025-01-09 21:23:45,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781011781011781 [2025-01-09 21:23:45,750 INFO L175 Difference]: Start difference. First operand has 198 places, 275 transitions, 2029 flow. Second operand 13 states and 1127 transitions. [2025-01-09 21:23:45,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 305 transitions, 2414 flow [2025-01-09 21:23:45,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 305 transitions, 2357 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:45,798 INFO L231 Difference]: Finished difference. Result has 207 places, 282 transitions, 2141 flow [2025-01-09 21:23:45,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2141, PETRI_PLACES=207, PETRI_TRANSITIONS=282} [2025-01-09 21:23:45,802 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 93 predicate places. [2025-01-09 21:23:45,803 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 282 transitions, 2141 flow [2025-01-09 21:23:45,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:45,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:45,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:45,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:23:45,803 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:45,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash -547508598, now seen corresponding path program 13 times [2025-01-09 21:23:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760525556] [2025-01-09 21:23:45,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:45,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:45,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:46,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760525556] [2025-01-09 21:23:46,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760525556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:46,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949203763] [2025-01-09 21:23:46,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:46,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:46,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:46,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:46,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:46,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:46,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 282 transitions, 2141 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:46,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:46,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:46,998 INFO L124 PetriNetUnfolderBase]: 1341/4682 cut-off events. [2025-01-09 21:23:46,999 INFO L125 PetriNetUnfolderBase]: For 12670/12926 co-relation queries the response was YES. [2025-01-09 21:23:47,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16053 conditions, 4682 events. 1341/4682 cut-off events. For 12670/12926 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 44602 event pairs, 58 based on Foata normal form. 32/4704 useless extension candidates. Maximal degree in co-relation 16003. Up to 885 conditions per place. [2025-01-09 21:23:47,030 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 47 selfloop transitions, 29 changer transitions 10/308 dead transitions. [2025-01-09 21:23:47,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 308 transitions, 2517 flow [2025-01-09 21:23:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1120 transitions. [2025-01-09 21:23:47,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7761607761607762 [2025-01-09 21:23:47,031 INFO L175 Difference]: Start difference. First operand has 207 places, 282 transitions, 2141 flow. Second operand 13 states and 1120 transitions. [2025-01-09 21:23:47,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 308 transitions, 2517 flow [2025-01-09 21:23:47,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 308 transitions, 2446 flow, removed 22 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:47,076 INFO L231 Difference]: Finished difference. Result has 214 places, 281 transitions, 2175 flow [2025-01-09 21:23:47,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2175, PETRI_PLACES=214, PETRI_TRANSITIONS=281} [2025-01-09 21:23:47,076 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places. [2025-01-09 21:23:47,076 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 281 transitions, 2175 flow [2025-01-09 21:23:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:47,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:47,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:47,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:23:47,077 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:47,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:47,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1563784084, now seen corresponding path program 14 times [2025-01-09 21:23:47,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:47,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498460257] [2025-01-09 21:23:47,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:47,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:47,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:47,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:47,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:47,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:47,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498460257] [2025-01-09 21:23:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498460257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647854621] [2025-01-09 21:23:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:47,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:47,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:47,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:47,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:47,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 281 transitions, 2175 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:47,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:47,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:47,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:48,332 INFO L124 PetriNetUnfolderBase]: 1331/4559 cut-off events. [2025-01-09 21:23:48,333 INFO L125 PetriNetUnfolderBase]: For 13041/13307 co-relation queries the response was YES. [2025-01-09 21:23:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15830 conditions, 4559 events. 1331/4559 cut-off events. For 13041/13307 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 43127 event pairs, 60 based on Foata normal form. 21/4570 useless extension candidates. Maximal degree in co-relation 15777. Up to 837 conditions per place. [2025-01-09 21:23:48,361 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 43 selfloop transitions, 28 changer transitions 1/294 dead transitions. [2025-01-09 21:23:48,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 294 transitions, 2443 flow [2025-01-09 21:23:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-01-09 21:23:48,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-01-09 21:23:48,362 INFO L175 Difference]: Start difference. First operand has 214 places, 281 transitions, 2175 flow. Second operand 13 states and 1122 transitions. [2025-01-09 21:23:48,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 294 transitions, 2443 flow [2025-01-09 21:23:48,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 294 transitions, 2310 flow, removed 27 selfloop flow, removed 13 redundant places. [2025-01-09 21:23:48,405 INFO L231 Difference]: Finished difference. Result has 215 places, 286 transitions, 2205 flow [2025-01-09 21:23:48,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2205, PETRI_PLACES=215, PETRI_TRANSITIONS=286} [2025-01-09 21:23:48,406 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 101 predicate places. [2025-01-09 21:23:48,406 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 286 transitions, 2205 flow [2025-01-09 21:23:48,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:48,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:48,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:48,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:23:48,407 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:48,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash 711019120, now seen corresponding path program 15 times [2025-01-09 21:23:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613848987] [2025-01-09 21:23:48,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:48,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:48,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:48,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:48,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613848987] [2025-01-09 21:23:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613848987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732744405] [2025-01-09 21:23:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:48,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:48,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:48,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 286 transitions, 2205 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:48,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:48,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:48,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:49,592 INFO L124 PetriNetUnfolderBase]: 1595/5447 cut-off events. [2025-01-09 21:23:49,592 INFO L125 PetriNetUnfolderBase]: For 15534/15805 co-relation queries the response was YES. [2025-01-09 21:23:49,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18823 conditions, 5447 events. 1595/5447 cut-off events. For 15534/15805 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 53655 event pairs, 71 based on Foata normal form. 21/5456 useless extension candidates. Maximal degree in co-relation 18770. Up to 1016 conditions per place. [2025-01-09 21:23:49,629 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 50 selfloop transitions, 28 changer transitions 5/305 dead transitions. [2025-01-09 21:23:49,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 305 transitions, 2561 flow [2025-01-09 21:23:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-01-09 21:23:49,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-01-09 21:23:49,630 INFO L175 Difference]: Start difference. First operand has 215 places, 286 transitions, 2205 flow. Second operand 13 states and 1123 transitions. [2025-01-09 21:23:49,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 305 transitions, 2561 flow [2025-01-09 21:23:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 305 transitions, 2461 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-01-09 21:23:49,682 INFO L231 Difference]: Finished difference. Result has 222 places, 292 transitions, 2291 flow [2025-01-09 21:23:49,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2291, PETRI_PLACES=222, PETRI_TRANSITIONS=292} [2025-01-09 21:23:49,683 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 108 predicate places. [2025-01-09 21:23:49,683 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 292 transitions, 2291 flow [2025-01-09 21:23:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:49,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:49,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:49,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:23:49,683 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2081631608, now seen corresponding path program 16 times [2025-01-09 21:23:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969983751] [2025-01-09 21:23:49,684 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:49,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:49,693 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:49,693 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:49,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969983751] [2025-01-09 21:23:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969983751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:23:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574382934] [2025-01-09 21:23:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:23:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:49,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:23:49,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:23:50,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-01-09 21:23:50,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 292 transitions, 2291 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:50,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:50,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-01-09 21:23:50,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:51,659 INFO L124 PetriNetUnfolderBase]: 2473/7474 cut-off events. [2025-01-09 21:23:51,660 INFO L125 PetriNetUnfolderBase]: For 32229/33004 co-relation queries the response was YES. [2025-01-09 21:23:51,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29913 conditions, 7474 events. 2473/7474 cut-off events. For 32229/33004 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 73518 event pairs, 311 based on Foata normal form. 148/7573 useless extension candidates. Maximal degree in co-relation 29857. Up to 1383 conditions per place. [2025-01-09 21:23:51,710 INFO L140 encePairwiseOnDemand]: 88/111 looper letters, 567 selfloop transitions, 140 changer transitions 27/826 dead transitions. [2025-01-09 21:23:51,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 826 transitions, 8775 flow [2025-01-09 21:23:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 21:23:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 21:23:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1652 transitions. [2025-01-09 21:23:51,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441441441441441 [2025-01-09 21:23:51,712 INFO L175 Difference]: Start difference. First operand has 222 places, 292 transitions, 2291 flow. Second operand 20 states and 1652 transitions. [2025-01-09 21:23:51,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 826 transitions, 8775 flow [2025-01-09 21:23:51,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 826 transitions, 8721 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:51,799 INFO L231 Difference]: Finished difference. Result has 241 places, 400 transitions, 4081 flow [2025-01-09 21:23:51,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4081, PETRI_PLACES=241, PETRI_TRANSITIONS=400} [2025-01-09 21:23:51,800 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 127 predicate places. [2025-01-09 21:23:51,800 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 400 transitions, 4081 flow [2025-01-09 21:23:51,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:23:51,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:51,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:51,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 21:23:51,801 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:51,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 548065722, now seen corresponding path program 17 times [2025-01-09 21:23:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:51,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675493113] [2025-01-09 21:23:51,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:51,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:51,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:51,812 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:51,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675493113] [2025-01-09 21:23:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675493113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321247875] [2025-01-09 21:23:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:52,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:52,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:52,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:52,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 400 transitions, 4081 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:52,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:52,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:52,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:53,239 INFO L124 PetriNetUnfolderBase]: 1638/5611 cut-off events. [2025-01-09 21:23:53,240 INFO L125 PetriNetUnfolderBase]: For 20504/20818 co-relation queries the response was YES. [2025-01-09 21:23:53,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20636 conditions, 5611 events. 1638/5611 cut-off events. For 20504/20818 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 55502 event pairs, 72 based on Foata normal form. 21/5619 useless extension candidates. Maximal degree in co-relation 20571. Up to 1051 conditions per place. [2025-01-09 21:23:53,278 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 56 selfloop transitions, 24 changer transitions 9/407 dead transitions. [2025-01-09 21:23:53,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 407 transitions, 4283 flow [2025-01-09 21:23:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1119 transitions. [2025-01-09 21:23:53,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7754677754677755 [2025-01-09 21:23:53,283 INFO L175 Difference]: Start difference. First operand has 241 places, 400 transitions, 4081 flow. Second operand 13 states and 1119 transitions. [2025-01-09 21:23:53,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 407 transitions, 4283 flow [2025-01-09 21:23:53,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 407 transitions, 4187 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-01-09 21:23:53,385 INFO L231 Difference]: Finished difference. Result has 248 places, 394 transitions, 3956 flow [2025-01-09 21:23:53,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3923, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3956, PETRI_PLACES=248, PETRI_TRANSITIONS=394} [2025-01-09 21:23:53,387 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 134 predicate places. [2025-01-09 21:23:53,387 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 394 transitions, 3956 flow [2025-01-09 21:23:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:53,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:53,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 21:23:53,387 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash -591192638, now seen corresponding path program 18 times [2025-01-09 21:23:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412272111] [2025-01-09 21:23:53,388 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:53,395 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:53,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:53,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:53,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:53,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:53,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412272111] [2025-01-09 21:23:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412272111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453123836] [2025-01-09 21:23:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:53,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:53,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:53,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:54,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:54,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 394 transitions, 3956 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:54,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:54,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:54,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:54,672 INFO L124 PetriNetUnfolderBase]: 1637/5546 cut-off events. [2025-01-09 21:23:54,672 INFO L125 PetriNetUnfolderBase]: For 19488/19783 co-relation queries the response was YES. [2025-01-09 21:23:54,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20171 conditions, 5546 events. 1637/5546 cut-off events. For 19488/19783 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 54738 event pairs, 72 based on Foata normal form. 37/5571 useless extension candidates. Maximal degree in co-relation 20105. Up to 1049 conditions per place. [2025-01-09 21:23:54,715 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 46 selfloop transitions, 35 changer transitions 8/402 dead transitions. [2025-01-09 21:23:54,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 402 transitions, 4216 flow [2025-01-09 21:23:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-01-09 21:23:54,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-01-09 21:23:54,716 INFO L175 Difference]: Start difference. First operand has 248 places, 394 transitions, 3956 flow. Second operand 13 states and 1122 transitions. [2025-01-09 21:23:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 402 transitions, 4216 flow [2025-01-09 21:23:54,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 402 transitions, 4126 flow, removed 16 selfloop flow, removed 15 redundant places. [2025-01-09 21:23:54,795 INFO L231 Difference]: Finished difference. Result has 244 places, 390 transitions, 3939 flow [2025-01-09 21:23:54,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3887, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3939, PETRI_PLACES=244, PETRI_TRANSITIONS=390} [2025-01-09 21:23:54,796 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 130 predicate places. [2025-01-09 21:23:54,796 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 390 transitions, 3939 flow [2025-01-09 21:23:54,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:54,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:54,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:54,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 21:23:54,797 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1834247090, now seen corresponding path program 19 times [2025-01-09 21:23:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206385892] [2025-01-09 21:23:54,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:54,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:54,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:54,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:54,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206385892] [2025-01-09 21:23:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206385892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499326477] [2025-01-09 21:23:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:54,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:54,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:54,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:55,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:55,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 390 transitions, 3939 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:55,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:55,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:55,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:55,932 INFO L124 PetriNetUnfolderBase]: 1366/4734 cut-off events. [2025-01-09 21:23:55,933 INFO L125 PetriNetUnfolderBase]: For 16326/16573 co-relation queries the response was YES. [2025-01-09 21:23:55,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 4734 events. 1366/4734 cut-off events. For 16326/16573 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 45185 event pairs, 61 based on Foata normal form. 17/4741 useless extension candidates. Maximal degree in co-relation 17178. Up to 876 conditions per place. [2025-01-09 21:23:55,971 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 46 selfloop transitions, 27 changer transitions 8/375 dead transitions. [2025-01-09 21:23:55,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 375 transitions, 3786 flow [2025-01-09 21:23:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-01-09 21:23:55,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-01-09 21:23:55,972 INFO L175 Difference]: Start difference. First operand has 244 places, 390 transitions, 3939 flow. Second operand 13 states and 1123 transitions. [2025-01-09 21:23:55,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 375 transitions, 3786 flow [2025-01-09 21:23:56,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 375 transitions, 3724 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:56,039 INFO L231 Difference]: Finished difference. Result has 246 places, 365 transitions, 3523 flow [2025-01-09 21:23:56,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3526, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3523, PETRI_PLACES=246, PETRI_TRANSITIONS=365} [2025-01-09 21:23:56,040 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 132 predicate places. [2025-01-09 21:23:56,040 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 365 transitions, 3523 flow [2025-01-09 21:23:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:56,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:56,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:56,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 21:23:56,040 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:56,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1064633108, now seen corresponding path program 20 times [2025-01-09 21:23:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865931977] [2025-01-09 21:23:56,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:56,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:56,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:56,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:56,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865931977] [2025-01-09 21:23:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865931977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181314982] [2025-01-09 21:23:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:56,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:56,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:56,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:56,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:56,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 365 transitions, 3523 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:56,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:56,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:57,243 INFO L124 PetriNetUnfolderBase]: 1061/3738 cut-off events. [2025-01-09 21:23:57,243 INFO L125 PetriNetUnfolderBase]: For 12017/12208 co-relation queries the response was YES. [2025-01-09 21:23:57,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13371 conditions, 3738 events. 1061/3738 cut-off events. For 12017/12208 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33894 event pairs, 52 based on Foata normal form. 14/3744 useless extension candidates. Maximal degree in co-relation 13306. Up to 680 conditions per place. [2025-01-09 21:23:57,264 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 37 selfloop transitions, 19 changer transitions 9/308 dead transitions. [2025-01-09 21:23:57,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 308 transitions, 2793 flow [2025-01-09 21:23:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-01-09 21:23:57,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-01-09 21:23:57,265 INFO L175 Difference]: Start difference. First operand has 246 places, 365 transitions, 3523 flow. Second operand 13 states and 1115 transitions. [2025-01-09 21:23:57,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 308 transitions, 2793 flow [2025-01-09 21:23:57,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 308 transitions, 2660 flow, removed 38 selfloop flow, removed 22 redundant places. [2025-01-09 21:23:57,317 INFO L231 Difference]: Finished difference. Result has 228 places, 298 transitions, 2472 flow [2025-01-09 21:23:57,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2472, PETRI_PLACES=228, PETRI_TRANSITIONS=298} [2025-01-09 21:23:57,317 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 114 predicate places. [2025-01-09 21:23:57,317 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 298 transitions, 2472 flow [2025-01-09 21:23:57,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:57,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:57,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:57,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 21:23:57,318 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:57,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash -437621666, now seen corresponding path program 21 times [2025-01-09 21:23:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:57,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723443215] [2025-01-09 21:23:57,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:57,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:57,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:57,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723443215] [2025-01-09 21:23:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723443215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:57,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:57,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:57,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330816245] [2025-01-09 21:23:57,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:57,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:57,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:57,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:58,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:58,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 298 transitions, 2472 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:58,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:58,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:58,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:58,428 INFO L124 PetriNetUnfolderBase]: 791/2889 cut-off events. [2025-01-09 21:23:58,428 INFO L125 PetriNetUnfolderBase]: For 7956/8102 co-relation queries the response was YES. [2025-01-09 21:23:58,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9906 conditions, 2889 events. 791/2889 cut-off events. For 7956/8102 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24759 event pairs, 31 based on Foata normal form. 12/2895 useless extension candidates. Maximal degree in co-relation 9851. Up to 511 conditions per place. [2025-01-09 21:23:58,447 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 35 selfloop transitions, 22 changer transitions 8/308 dead transitions. [2025-01-09 21:23:58,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 308 transitions, 2645 flow [2025-01-09 21:23:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1111 transitions. [2025-01-09 21:23:58,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7699237699237699 [2025-01-09 21:23:58,449 INFO L175 Difference]: Start difference. First operand has 228 places, 298 transitions, 2472 flow. Second operand 13 states and 1111 transitions. [2025-01-09 21:23:58,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 308 transitions, 2645 flow [2025-01-09 21:23:58,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 308 transitions, 2557 flow, removed 16 selfloop flow, removed 17 redundant places. [2025-01-09 21:23:58,478 INFO L231 Difference]: Finished difference. Result has 214 places, 292 transitions, 2373 flow [2025-01-09 21:23:58,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2373, PETRI_PLACES=214, PETRI_TRANSITIONS=292} [2025-01-09 21:23:58,478 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places. [2025-01-09 21:23:58,479 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 292 transitions, 2373 flow [2025-01-09 21:23:58,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:58,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:58,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 21:23:58,479 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:58,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash 894688520, now seen corresponding path program 22 times [2025-01-09 21:23:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822713059] [2025-01-09 21:23:58,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:58,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:23:58,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:58,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:58,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822713059] [2025-01-09 21:23:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822713059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130008569] [2025-01-09 21:23:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:58,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:58,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:58,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:59,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:23:59,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 292 transitions, 2373 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:59,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:59,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:23:59,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:59,524 INFO L124 PetriNetUnfolderBase]: 793/2842 cut-off events. [2025-01-09 21:23:59,524 INFO L125 PetriNetUnfolderBase]: For 7591/7740 co-relation queries the response was YES. [2025-01-09 21:23:59,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9635 conditions, 2842 events. 793/2842 cut-off events. For 7591/7740 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24216 event pairs, 35 based on Foata normal form. 12/2848 useless extension candidates. Maximal degree in co-relation 9586. Up to 517 conditions per place. [2025-01-09 21:23:59,542 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 29 selfloop transitions, 24 changer transitions 7/301 dead transitions. [2025-01-09 21:23:59,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 301 transitions, 2548 flow [2025-01-09 21:23:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2025-01-09 21:23:59,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.772002772002772 [2025-01-09 21:23:59,543 INFO L175 Difference]: Start difference. First operand has 214 places, 292 transitions, 2373 flow. Second operand 13 states and 1114 transitions. [2025-01-09 21:23:59,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 301 transitions, 2548 flow [2025-01-09 21:23:59,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 301 transitions, 2465 flow, removed 8 selfloop flow, removed 16 redundant places. [2025-01-09 21:23:59,572 INFO L231 Difference]: Finished difference. Result has 207 places, 289 transitions, 2322 flow [2025-01-09 21:23:59,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2322, PETRI_PLACES=207, PETRI_TRANSITIONS=289} [2025-01-09 21:23:59,572 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 93 predicate places. [2025-01-09 21:23:59,572 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 289 transitions, 2322 flow [2025-01-09 21:23:59,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:23:59,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:59,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 21:23:59,573 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:23:59,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash -769398334, now seen corresponding path program 23 times [2025-01-09 21:23:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-01-09 21:23:59,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:59,581 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:23:59,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:23:59,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:59,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-01-09 21:23:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690313284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:23:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818545905] [2025-01-09 21:23:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:59,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:59,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:59,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:00,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:00,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 289 transitions, 2322 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:00,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:00,739 INFO L124 PetriNetUnfolderBase]: 790/2853 cut-off events. [2025-01-09 21:24:00,739 INFO L125 PetriNetUnfolderBase]: For 7523/7672 co-relation queries the response was YES. [2025-01-09 21:24:00,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9607 conditions, 2853 events. 790/2853 cut-off events. For 7523/7672 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24421 event pairs, 36 based on Foata normal form. 10/2857 useless extension candidates. Maximal degree in co-relation 9562. Up to 516 conditions per place. [2025-01-09 21:24:00,756 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 30 selfloop transitions, 21 changer transitions 6/298 dead transitions. [2025-01-09 21:24:00,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 298 transitions, 2491 flow [2025-01-09 21:24:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-01-09 21:24:00,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-01-09 21:24:00,757 INFO L175 Difference]: Start difference. First operand has 207 places, 289 transitions, 2322 flow. Second operand 13 states and 1115 transitions. [2025-01-09 21:24:00,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 298 transitions, 2491 flow [2025-01-09 21:24:00,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 298 transitions, 2440 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-01-09 21:24:00,784 INFO L231 Difference]: Finished difference. Result has 210 places, 289 transitions, 2331 flow [2025-01-09 21:24:00,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2331, PETRI_PLACES=210, PETRI_TRANSITIONS=289} [2025-01-09 21:24:00,784 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 96 predicate places. [2025-01-09 21:24:00,784 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 289 transitions, 2331 flow [2025-01-09 21:24:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 21:24:00,785 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1360883592, now seen corresponding path program 24 times [2025-01-09 21:24:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-01-09 21:24:00,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:24:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:00,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:00,798 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:00,801 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:24:00,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511520105] [2025-01-09 21:24:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511520105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012726128] [2025-01-09 21:24:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:01,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:01,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:01,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:01,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:01,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:01,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 289 transitions, 2331 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:01,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:01,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:01,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:01,838 INFO L124 PetriNetUnfolderBase]: 525/2012 cut-off events. [2025-01-09 21:24:01,838 INFO L125 PetriNetUnfolderBase]: For 4901/5010 co-relation queries the response was YES. [2025-01-09 21:24:01,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6654 conditions, 2012 events. 525/2012 cut-off events. For 4901/5010 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15588 event pairs, 25 based on Foata normal form. 7/2015 useless extension candidates. Maximal degree in co-relation 6607. Up to 348 conditions per place. [2025-01-09 21:24:01,849 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 23 selfloop transitions, 15 changer transitions 15/275 dead transitions. [2025-01-09 21:24:01,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 275 transitions, 2141 flow [2025-01-09 21:24:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1110 transitions. [2025-01-09 21:24:01,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2025-01-09 21:24:01,851 INFO L175 Difference]: Start difference. First operand has 210 places, 289 transitions, 2331 flow. Second operand 13 states and 1110 transitions. [2025-01-09 21:24:01,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 275 transitions, 2141 flow [2025-01-09 21:24:01,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 275 transitions, 2088 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-01-09 21:24:01,869 INFO L231 Difference]: Finished difference. Result has 209 places, 259 transitions, 1881 flow [2025-01-09 21:24:01,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1881, PETRI_PLACES=209, PETRI_TRANSITIONS=259} [2025-01-09 21:24:01,869 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 95 predicate places. [2025-01-09 21:24:01,869 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 259 transitions, 1881 flow [2025-01-09 21:24:01,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:01,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:01,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 21:24:01,870 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash -578196982, now seen corresponding path program 25 times [2025-01-09 21:24:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172021118] [2025-01-09 21:24:01,870 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:24:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:01,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:01,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:01,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:01,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172021118] [2025-01-09 21:24:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172021118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:02,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:02,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416934462] [2025-01-09 21:24:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:02,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:02,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:02,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:02,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 259 transitions, 1881 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:02,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:02,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:02,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:02,882 INFO L124 PetriNetUnfolderBase]: 780/2741 cut-off events. [2025-01-09 21:24:02,883 INFO L125 PetriNetUnfolderBase]: For 6703/6850 co-relation queries the response was YES. [2025-01-09 21:24:02,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 2741 events. 780/2741 cut-off events. For 6703/6850 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 23348 event pairs, 31 based on Foata normal form. 15/2750 useless extension candidates. Maximal degree in co-relation 9019. Up to 507 conditions per place. [2025-01-09 21:24:02,899 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 26 selfloop transitions, 25 changer transitions 1/274 dead transitions. [2025-01-09 21:24:02,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 274 transitions, 2069 flow [2025-01-09 21:24:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1116 transitions. [2025-01-09 21:24:02,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733887733887734 [2025-01-09 21:24:02,900 INFO L175 Difference]: Start difference. First operand has 209 places, 259 transitions, 1881 flow. Second operand 13 states and 1116 transitions. [2025-01-09 21:24:02,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 274 transitions, 2069 flow [2025-01-09 21:24:02,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 274 transitions, 1961 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:02,923 INFO L231 Difference]: Finished difference. Result has 194 places, 267 transitions, 1920 flow [2025-01-09 21:24:02,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1920, PETRI_PLACES=194, PETRI_TRANSITIONS=267} [2025-01-09 21:24:02,923 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 80 predicate places. [2025-01-09 21:24:02,923 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 267 transitions, 1920 flow [2025-01-09 21:24:02,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:02,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:02,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 21:24:02,924 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:02,925 INFO L85 PathProgramCache]: Analyzing trace with hash -709888218, now seen corresponding path program 21 times [2025-01-09 21:24:02,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:02,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978867075] [2025-01-09 21:24:02,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:24:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:02,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:02,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:02,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:24:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978867075] [2025-01-09 21:24:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978867075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939502471] [2025-01-09 21:24:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:03,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:03,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:03,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:03,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 267 transitions, 1920 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:03,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:03,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:03,984 INFO L124 PetriNetUnfolderBase]: 782/2733 cut-off events. [2025-01-09 21:24:03,984 INFO L125 PetriNetUnfolderBase]: For 6476/6649 co-relation queries the response was YES. [2025-01-09 21:24:03,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 2733 events. 782/2733 cut-off events. For 6476/6649 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23238 event pairs, 30 based on Foata normal form. 30/2757 useless extension candidates. Maximal degree in co-relation 8997. Up to 498 conditions per place. [2025-01-09 21:24:03,999 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 18 selfloop transitions, 33 changer transitions 3/276 dead transitions. [2025-01-09 21:24:03,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 276 transitions, 2100 flow [2025-01-09 21:24:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1103 transitions. [2025-01-09 21:24:04,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7643797643797644 [2025-01-09 21:24:04,000 INFO L175 Difference]: Start difference. First operand has 194 places, 267 transitions, 1920 flow. Second operand 13 states and 1103 transitions. [2025-01-09 21:24:04,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 276 transitions, 2100 flow [2025-01-09 21:24:04,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 276 transitions, 2063 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-09 21:24:04,023 INFO L231 Difference]: Finished difference. Result has 200 places, 267 transitions, 1964 flow [2025-01-09 21:24:04,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1964, PETRI_PLACES=200, PETRI_TRANSITIONS=267} [2025-01-09 21:24:04,023 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 86 predicate places. [2025-01-09 21:24:04,023 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 267 transitions, 1964 flow [2025-01-09 21:24:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:04,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:04,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:04,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 21:24:04,024 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1485048612, now seen corresponding path program 22 times [2025-01-09 21:24:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-01-09 21:24:04,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:24:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:04,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-01-09 21:24:04,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:04,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:24:04,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-01-09 21:24:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134956455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:24:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980028130] [2025-01-09 21:24:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:24:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:04,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:24:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:24:04,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-01-09 21:24:04,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 267 transitions, 1964 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:24:04,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:04,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-01-09 21:24:04,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:05,894 INFO L124 PetriNetUnfolderBase]: 1013/3196 cut-off events. [2025-01-09 21:24:05,894 INFO L125 PetriNetUnfolderBase]: For 11893/12308 co-relation queries the response was YES. [2025-01-09 21:24:05,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12358 conditions, 3196 events. 1013/3196 cut-off events. For 11893/12308 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26668 event pairs, 103 based on Foata normal form. 88/3267 useless extension candidates. Maximal degree in co-relation 12313. Up to 579 conditions per place. [2025-01-09 21:24:05,913 INFO L140 encePairwiseOnDemand]: 87/111 looper letters, 402 selfloop transitions, 102 changer transitions 72/669 dead transitions. [2025-01-09 21:24:05,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 669 transitions, 6845 flow [2025-01-09 21:24:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 21:24:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 21:24:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1919 transitions. [2025-01-09 21:24:05,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7203453453453453 [2025-01-09 21:24:05,917 INFO L175 Difference]: Start difference. First operand has 200 places, 267 transitions, 1964 flow. Second operand 24 states and 1919 transitions. [2025-01-09 21:24:05,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 669 transitions, 6845 flow [2025-01-09 21:24:05,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 669 transitions, 6735 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-01-09 21:24:05,949 INFO L231 Difference]: Finished difference. Result has 223 places, 342 transitions, 3139 flow [2025-01-09 21:24:05,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3139, PETRI_PLACES=223, PETRI_TRANSITIONS=342} [2025-01-09 21:24:05,951 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 109 predicate places. [2025-01-09 21:24:05,951 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 342 transitions, 3139 flow [2025-01-09 21:24:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 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) [2025-01-09 21:24:05,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:05,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 21:24:05,952 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -585176958, now seen corresponding path program 23 times [2025-01-09 21:24:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114507463] [2025-01-09 21:24:05,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:24:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:05,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:05,969 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:05,969 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:06,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:06,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114507463] [2025-01-09 21:24:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114507463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:06,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:06,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869251195] [2025-01-09 21:24:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:06,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:06,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:06,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:06,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:06,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 342 transitions, 3139 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:06,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:06,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:07,146 INFO L124 PetriNetUnfolderBase]: 781/2750 cut-off events. [2025-01-09 21:24:07,146 INFO L125 PetriNetUnfolderBase]: For 8805/8959 co-relation queries the response was YES. [2025-01-09 21:24:07,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9866 conditions, 2750 events. 781/2750 cut-off events. For 8805/8959 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 23444 event pairs, 31 based on Foata normal form. 19/2763 useless extension candidates. Maximal degree in co-relation 9809. Up to 509 conditions per place. [2025-01-09 21:24:07,161 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 35 selfloop transitions, 25 changer transitions 4/354 dead transitions. [2025-01-09 21:24:07,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 354 transitions, 3334 flow [2025-01-09 21:24:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2025-01-09 21:24:07,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.772002772002772 [2025-01-09 21:24:07,163 INFO L175 Difference]: Start difference. First operand has 223 places, 342 transitions, 3139 flow. Second operand 13 states and 1114 transitions. [2025-01-09 21:24:07,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 354 transitions, 3334 flow [2025-01-09 21:24:07,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 354 transitions, 3285 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-01-09 21:24:07,192 INFO L231 Difference]: Finished difference. Result has 226 places, 344 transitions, 3176 flow [2025-01-09 21:24:07,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3090, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3176, PETRI_PLACES=226, PETRI_TRANSITIONS=344} [2025-01-09 21:24:07,193 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 112 predicate places. [2025-01-09 21:24:07,193 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 344 transitions, 3176 flow [2025-01-09 21:24:07,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:07,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:07,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:07,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 21:24:07,193 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -605094856, now seen corresponding path program 24 times [2025-01-09 21:24:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:07,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796081279] [2025-01-09 21:24:07,194 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:24:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:07,200 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:07,204 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:07,204 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:24:07,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796081279] [2025-01-09 21:24:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796081279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969585244] [2025-01-09 21:24:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:07,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:07,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:07,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:07,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:07,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 344 transitions, 3176 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:07,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:07,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:07,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:08,293 INFO L124 PetriNetUnfolderBase]: 512/1924 cut-off events. [2025-01-09 21:24:08,293 INFO L125 PetriNetUnfolderBase]: For 6171/6288 co-relation queries the response was YES. [2025-01-09 21:24:08,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6863 conditions, 1924 events. 512/1924 cut-off events. For 6171/6288 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14976 event pairs, 19 based on Foata normal form. 17/1937 useless extension candidates. Maximal degree in co-relation 6805. Up to 345 conditions per place. [2025-01-09 21:24:08,303 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 31 selfloop transitions, 16 changer transitions 11/329 dead transitions. [2025-01-09 21:24:08,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 329 transitions, 3006 flow [2025-01-09 21:24:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1108 transitions. [2025-01-09 21:24:08,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7678447678447679 [2025-01-09 21:24:08,304 INFO L175 Difference]: Start difference. First operand has 226 places, 344 transitions, 3176 flow. Second operand 13 states and 1108 transitions. [2025-01-09 21:24:08,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 329 transitions, 3006 flow [2025-01-09 21:24:08,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 329 transitions, 2943 flow, removed 10 selfloop flow, removed 12 redundant places. [2025-01-09 21:24:08,327 INFO L231 Difference]: Finished difference. Result has 228 places, 316 transitions, 2780 flow [2025-01-09 21:24:08,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2791, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2780, PETRI_PLACES=228, PETRI_TRANSITIONS=316} [2025-01-09 21:24:08,327 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 114 predicate places. [2025-01-09 21:24:08,328 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 316 transitions, 2780 flow [2025-01-09 21:24:08,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:08,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:08,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:08,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 21:24:08,328 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:08,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash -390081828, now seen corresponding path program 25 times [2025-01-09 21:24:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934123773] [2025-01-09 21:24:08,329 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:24:08,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:08,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:08,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934123773] [2025-01-09 21:24:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934123773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009200456] [2025-01-09 21:24:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:08,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:08,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:09,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:09,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 316 transitions, 2780 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:09,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:09,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:09,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:09,319 INFO L124 PetriNetUnfolderBase]: 516/1874 cut-off events. [2025-01-09 21:24:09,319 INFO L125 PetriNetUnfolderBase]: For 6127/6255 co-relation queries the response was YES. [2025-01-09 21:24:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 1874 events. 516/1874 cut-off events. For 6127/6255 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14410 event pairs, 20 based on Foata normal form. 18/1888 useless extension candidates. Maximal degree in co-relation 6660. Up to 336 conditions per place. [2025-01-09 21:24:09,330 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 22 selfloop transitions, 25 changer transitions 4/322 dead transitions. [2025-01-09 21:24:09,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 322 transitions, 2953 flow [2025-01-09 21:24:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1103 transitions. [2025-01-09 21:24:09,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7643797643797644 [2025-01-09 21:24:09,331 INFO L175 Difference]: Start difference. First operand has 228 places, 316 transitions, 2780 flow. Second operand 13 states and 1103 transitions. [2025-01-09 21:24:09,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 322 transitions, 2953 flow [2025-01-09 21:24:09,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 322 transitions, 2854 flow, removed 9 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:09,354 INFO L231 Difference]: Finished difference. Result has 216 places, 316 transitions, 2773 flow [2025-01-09 21:24:09,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2702, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2773, PETRI_PLACES=216, PETRI_TRANSITIONS=316} [2025-01-09 21:24:09,354 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 102 predicate places. [2025-01-09 21:24:09,354 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 316 transitions, 2773 flow [2025-01-09 21:24:09,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:09,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:09,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:09,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-09 21:24:09,355 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:09,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1174224924, now seen corresponding path program 26 times [2025-01-09 21:24:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514628931] [2025-01-09 21:24:09,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:09,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:09,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:09,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:09,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514628931] [2025-01-09 21:24:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514628931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645590231] [2025-01-09 21:24:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:09,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:09,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:09,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:10,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:10,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 316 transitions, 2773 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:10,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:10,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:10,511 INFO L124 PetriNetUnfolderBase]: 248/1042 cut-off events. [2025-01-09 21:24:10,511 INFO L125 PetriNetUnfolderBase]: For 2839/2897 co-relation queries the response was YES. [2025-01-09 21:24:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3575 conditions, 1042 events. 248/1042 cut-off events. For 2839/2897 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6738 event pairs, 11 based on Foata normal form. 6/1046 useless extension candidates. Maximal degree in co-relation 3521. Up to 172 conditions per place. [2025-01-09 21:24:10,517 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 16 selfloop transitions, 14 changer transitions 7/259 dead transitions. [2025-01-09 21:24:10,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 259 transitions, 2066 flow [2025-01-09 21:24:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1102 transitions. [2025-01-09 21:24:10,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636867636867637 [2025-01-09 21:24:10,518 INFO L175 Difference]: Start difference. First operand has 216 places, 316 transitions, 2773 flow. Second operand 13 states and 1102 transitions. [2025-01-09 21:24:10,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 259 transitions, 2066 flow [2025-01-09 21:24:10,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 259 transitions, 1907 flow, removed 47 selfloop flow, removed 23 redundant places. [2025-01-09 21:24:10,530 INFO L231 Difference]: Finished difference. Result has 193 places, 252 transitions, 1811 flow [2025-01-09 21:24:10,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1811, PETRI_PLACES=193, PETRI_TRANSITIONS=252} [2025-01-09 21:24:10,530 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 79 predicate places. [2025-01-09 21:24:10,530 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 252 transitions, 1811 flow [2025-01-09 21:24:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:10,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:10,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:10,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 21:24:10,531 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1752499402, now seen corresponding path program 26 times [2025-01-09 21:24:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899729438] [2025-01-09 21:24:10,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:10,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:10,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:10,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899729438] [2025-01-09 21:24:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899729438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:10,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:10,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605589798] [2025-01-09 21:24:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:10,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:10,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:11,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:11,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 252 transitions, 1811 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:11,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:11,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:11,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:11,403 INFO L124 PetriNetUnfolderBase]: 244/1035 cut-off events. [2025-01-09 21:24:11,403 INFO L125 PetriNetUnfolderBase]: For 2146/2191 co-relation queries the response was YES. [2025-01-09 21:24:11,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1035 events. 244/1035 cut-off events. For 2146/2191 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6729 event pairs, 12 based on Foata normal form. 9/1042 useless extension candidates. Maximal degree in co-relation 3261. Up to 178 conditions per place. [2025-01-09 21:24:11,408 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 11 selfloop transitions, 19 changer transitions 8/258 dead transitions. [2025-01-09 21:24:11,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 258 transitions, 1927 flow [2025-01-09 21:24:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1102 transitions. [2025-01-09 21:24:11,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636867636867637 [2025-01-09 21:24:11,410 INFO L175 Difference]: Start difference. First operand has 193 places, 252 transitions, 1811 flow. Second operand 13 states and 1102 transitions. [2025-01-09 21:24:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 258 transitions, 1927 flow [2025-01-09 21:24:11,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 258 transitions, 1869 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-01-09 21:24:11,435 INFO L231 Difference]: Finished difference. Result has 187 places, 249 transitions, 1788 flow [2025-01-09 21:24:11,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1788, PETRI_PLACES=187, PETRI_TRANSITIONS=249} [2025-01-09 21:24:11,436 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 73 predicate places. [2025-01-09 21:24:11,436 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 249 transitions, 1788 flow [2025-01-09 21:24:11,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:11,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:11,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-09 21:24:11,441 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:24:11,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1212456546, now seen corresponding path program 27 times [2025-01-09 21:24:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613697280] [2025-01-09 21:24:11,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:24:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:11,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:24:11,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:24:11,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:24:11,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:24:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613697280] [2025-01-09 21:24:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613697280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:11,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:11,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 21:24:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826690099] [2025-01-09 21:24:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:11,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:24:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:11,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:24:11,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:24:12,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-01-09 21:24:12,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 249 transitions, 1788 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:12,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:12,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-01-09 21:24:12,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:12,548 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-01-09 21:24:12,548 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-01-09 21:24:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 102 events. 0/102 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 2/104 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2025-01-09 21:24:12,549 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 0 selfloop transitions, 0 changer transitions 90/90 dead transitions. [2025-01-09 21:24:12,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 90 transitions, 446 flow [2025-01-09 21:24:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1093 transitions. [2025-01-09 21:24:12,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7574497574497574 [2025-01-09 21:24:12,550 INFO L175 Difference]: Start difference. First operand has 187 places, 249 transitions, 1788 flow. Second operand 13 states and 1093 transitions. [2025-01-09 21:24:12,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 90 transitions, 446 flow [2025-01-09 21:24:12,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 90 transitions, 266 flow, removed 31 selfloop flow, removed 57 redundant places. [2025-01-09 21:24:12,551 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2025-01-09 21:24:12,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2025-01-09 21:24:12,552 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-01-09 21:24:12,552 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2025-01-09 21:24:12,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 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) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:24:12,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:24:12,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:24:12,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-09 21:24:12,558 INFO L422 BasicCegarLoop]: Path program histogram: [27, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:12,566 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:24:12,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:24:12,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:24:12 BasicIcfg [2025-01-09 21:24:12,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:24:12,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:24:12,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:24:12,572 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:24:12,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:50" (3/4) ... [2025-01-09 21:24:12,574 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:24:12,576 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 21:24:12,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 21:24:12,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:24:12,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:24:12,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:24:12,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:24:12,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:24:12,628 INFO L158 Benchmark]: Toolchain (without parser) took 82553.47ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 111.7MB in the beginning and 680.9MB in the end (delta: -569.3MB). Peak memory consumption was 336.7MB. Max. memory is 16.1GB. [2025-01-09 21:24:12,628 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:24:12,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.30ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:24:12,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.38ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:24:12,628 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:24:12,629 INFO L158 Benchmark]: RCFGBuilder took 284.20ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 67.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:24:12,629 INFO L158 Benchmark]: TraceAbstraction took 81744.73ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 67.2MB in the beginning and 689.2MB in the end (delta: -622.0MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. [2025-01-09 21:24:12,629 INFO L158 Benchmark]: Witness Printer took 55.97ms. Allocated memory is still 1.0GB. Free memory was 689.2MB in the beginning and 680.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:24:12,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 124.7MB in the beginning and 124.4MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.30ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.38ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.20ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 67.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 81744.73ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 67.2MB in the beginning and 689.2MB in the end (delta: -622.0MB). Peak memory consumption was 286.4MB. Max. memory is 16.1GB. * Witness Printer took 55.97ms. Allocated memory is still 1.0GB. Free memory was 689.2MB in the beginning and 680.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3011]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 2995]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3013]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3005]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 81.7s, OverallIterations: 61, TraceHistogramMax: 1, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30909 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26964 mSDsluCounter, 117385 SdHoareTripleChecker+Invalid, 26.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115510 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77786 IncrementalHoareTripleChecker+Invalid, 78265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 1875 mSDtfsCounter, 77786 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1098 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4081occurred in iteration=44, InterpolantAutomatonStates: 774, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 3992 NumberOfCodeBlocks, 3992 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 3931 ConstructedInterpolants, 0 QuantifiedInterpolants, 19498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 61 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:24:12,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE