./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:35:46,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:35:46,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:35:46,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:35:46,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:35:47,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:35:47,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:35:47,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:35:47,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:35:47,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:35:47,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:35:47,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:35:47,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:35:47,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:35:47,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:35:47,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:35:47,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:35:47,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:35:47,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:35:47,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:35:47,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:35:47,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:35:47,014 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:35:47,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:35:47,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:35:47,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:35:47,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:35:47,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:35:47,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:35:47,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:35:47,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:35:47,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:47,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:35:47,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:35:47,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:35:47,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:35:47,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:35:47,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:35:47,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:35:47,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:35:47,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:35:47,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2024-11-10 14:35:47,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:35:47,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:35:47,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:35:47,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:35:47,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:35:47,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-10 14:35:48,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:35:48,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:35:48,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2024-11-10 14:35:48,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f817e46/facf4890bdaf48f1985967266313b5af/FLAG2e6d10387 [2024-11-10 14:35:48,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f817e46/facf4890bdaf48f1985967266313b5af [2024-11-10 14:35:48,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:35:48,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:35:48,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:48,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:35:48,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:35:48,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:48" (1/1) ... [2024-11-10 14:35:48,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b53b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:48, skipping insertion in model container [2024-11-10 14:35:48,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:48" (1/1) ... [2024-11-10 14:35:48,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:35:48,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:48,997 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:35:49,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:49,039 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:35:49,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49 WrapperNode [2024-11-10 14:35:49,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:49,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:49,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:35:49,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:35:49,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,085 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 482 [2024-11-10 14:35:49,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:49,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:35:49,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:35:49,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:35:49,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:35:49,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:35:49,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:35:49,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:35:49,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (1/1) ... [2024-11-10 14:35:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:35:49,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:35:49,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:35:49,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:35:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:35:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:35:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:35:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:35:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:35:49,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:35:49,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:35:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:35:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:35:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:35:49,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:35:49,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:35:49,313 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:35:49,427 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:35:49,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:35:49,999 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:35:49,999 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:35:50,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:35:50,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:35:50,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:50 BoogieIcfgContainer [2024-11-10 14:35:50,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:35:50,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:35:50,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:35:50,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:35:50,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:35:48" (1/3) ... [2024-11-10 14:35:50,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1f8b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:50, skipping insertion in model container [2024-11-10 14:35:50,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:49" (2/3) ... [2024-11-10 14:35:50,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1f8b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:50, skipping insertion in model container [2024-11-10 14:35:50,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:50" (3/3) ... [2024-11-10 14:35:50,047 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2024-11-10 14:35:50,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:35:50,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-10 14:35:50,065 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:35:50,232 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:35:50,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 611 places, 634 transitions, 1289 flow [2024-11-10 14:35:50,443 INFO L124 PetriNetUnfolderBase]: 33/631 cut-off events. [2024-11-10 14:35:50,443 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:35:50,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 631 events. 33/631 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1559 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 470. Up to 3 conditions per place. [2024-11-10 14:35:50,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 611 places, 634 transitions, 1289 flow [2024-11-10 14:35:50,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 590 places, 611 transitions, 1240 flow [2024-11-10 14:35:50,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:35:50,474 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;@7ab460b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:35:50,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-11-10 14:35:50,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:35:50,477 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 14:35:50,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:35:50,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:50,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:50,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1151306567, now seen corresponding path program 1 times [2024-11-10 14:35:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670184666] [2024-11-10 14:35:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:50,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670184666] [2024-11-10 14:35:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670184666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969413705] [2024-11-10 14:35:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:50,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:50,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 634 [2024-11-10 14:35:50,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 611 transitions, 1240 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:50,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:50,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 634 [2024-11-10 14:35:50,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:51,039 INFO L124 PetriNetUnfolderBase]: 56/1491 cut-off events. [2024-11-10 14:35:51,040 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 14:35:51,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 1491 events. 56/1491 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8343 event pairs, 20 based on Foata normal form. 42/1293 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2024-11-10 14:35:51,072 INFO L140 encePairwiseOnDemand]: 612/634 looper letters, 14 selfloop transitions, 2 changer transitions 7/591 dead transitions. [2024-11-10 14:35:51,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 591 transitions, 1232 flow [2024-11-10 14:35:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1821 transitions. [2024-11-10 14:35:51,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9574132492113565 [2024-11-10 14:35:51,095 INFO L175 Difference]: Start difference. First operand has 590 places, 611 transitions, 1240 flow. Second operand 3 states and 1821 transitions. [2024-11-10 14:35:51,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 591 transitions, 1232 flow [2024-11-10 14:35:51,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:35:51,116 INFO L231 Difference]: Finished difference. Result has 585 places, 584 transitions, 1178 flow [2024-11-10 14:35:51,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1178, PETRI_PLACES=585, PETRI_TRANSITIONS=584} [2024-11-10 14:35:51,122 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -5 predicate places. [2024-11-10 14:35:51,123 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 584 transitions, 1178 flow [2024-11-10 14:35:51,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:51,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:51,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:35:51,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:51,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -106801607, now seen corresponding path program 1 times [2024-11-10 14:35:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299215997] [2024-11-10 14:35:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299215997] [2024-11-10 14:35:51,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299215997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:51,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:51,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624162112] [2024-11-10 14:35:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:51,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:51,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 634 [2024-11-10 14:35:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 584 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 634 [2024-11-10 14:35:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:51,408 INFO L124 PetriNetUnfolderBase]: 36/1027 cut-off events. [2024-11-10 14:35:51,408 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:35:51,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 1027 events. 36/1027 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4616 event pairs, 12 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 1045. Up to 39 conditions per place. [2024-11-10 14:35:51,428 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 14 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-10 14:35:51,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 583 transitions, 1208 flow [2024-11-10 14:35:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2024-11-10 14:35:51,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9474237644584648 [2024-11-10 14:35:51,432 INFO L175 Difference]: Start difference. First operand has 585 places, 584 transitions, 1178 flow. Second operand 3 states and 1802 transitions. [2024-11-10 14:35:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 583 transitions, 1208 flow [2024-11-10 14:35:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:51,439 INFO L231 Difference]: Finished difference. Result has 577 places, 583 transitions, 1176 flow [2024-11-10 14:35:51,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1176, PETRI_PLACES=577, PETRI_TRANSITIONS=583} [2024-11-10 14:35:51,440 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -13 predicate places. [2024-11-10 14:35:51,440 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 583 transitions, 1176 flow [2024-11-10 14:35:51,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:51,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:51,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:35:51,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 535297599, now seen corresponding path program 1 times [2024-11-10 14:35:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:51,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890651427] [2024-11-10 14:35:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:51,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890651427] [2024-11-10 14:35:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890651427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:51,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:51,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194209365] [2024-11-10 14:35:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:51,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:51,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:51,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 634 [2024-11-10 14:35:51,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 583 transitions, 1176 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 634 [2024-11-10 14:35:51,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:51,766 INFO L124 PetriNetUnfolderBase]: 56/1458 cut-off events. [2024-11-10 14:35:51,766 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-10 14:35:51,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 1458 events. 56/1458 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7815 event pairs, 20 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 1478. Up to 51 conditions per place. [2024-11-10 14:35:51,787 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 14 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-11-10 14:35:51,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1206 flow [2024-11-10 14:35:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2024-11-10 14:35:51,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9474237644584648 [2024-11-10 14:35:51,790 INFO L175 Difference]: Start difference. First operand has 577 places, 583 transitions, 1176 flow. Second operand 3 states and 1802 transitions. [2024-11-10 14:35:51,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1206 flow [2024-11-10 14:35:51,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:51,800 INFO L231 Difference]: Finished difference. Result has 576 places, 582 transitions, 1174 flow [2024-11-10 14:35:51,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1174, PETRI_PLACES=576, PETRI_TRANSITIONS=582} [2024-11-10 14:35:51,801 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -14 predicate places. [2024-11-10 14:35:51,801 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 582 transitions, 1174 flow [2024-11-10 14:35:51,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:51,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:51,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:35:51,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -730093629, now seen corresponding path program 1 times [2024-11-10 14:35:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:51,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483886285] [2024-11-10 14:35:51,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483886285] [2024-11-10 14:35:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483886285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:51,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035660162] [2024-11-10 14:35:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:51,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:51,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:51,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 634 [2024-11-10 14:35:51,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 582 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 634 [2024-11-10 14:35:51,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:52,191 INFO L124 PetriNetUnfolderBase]: 132/2499 cut-off events. [2024-11-10 14:35:52,191 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:35:52,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 2499 events. 132/2499 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18589 event pairs, 64 based on Foata normal form. 0/2127 useless extension candidates. Maximal degree in co-relation 2624. Up to 138 conditions per place. [2024-11-10 14:35:52,226 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 16 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2024-11-10 14:35:52,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1198 flow [2024-11-10 14:35:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-10 14:35:52,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9437434279705573 [2024-11-10 14:35:52,230 INFO L175 Difference]: Start difference. First operand has 576 places, 582 transitions, 1174 flow. Second operand 3 states and 1795 transitions. [2024-11-10 14:35:52,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1198 flow [2024-11-10 14:35:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:52,236 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1162 flow [2024-11-10 14:35:52,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-11-10 14:35:52,237 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2024-11-10 14:35:52,238 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1162 flow [2024-11-10 14:35:52,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:52,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:52,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:52,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:35:52,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:52,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -197116020, now seen corresponding path program 1 times [2024-11-10 14:35:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526774503] [2024-11-10 14:35:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526774503] [2024-11-10 14:35:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526774503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399565787] [2024-11-10 14:35:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:52,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 634 [2024-11-10 14:35:52,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:52,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:52,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 634 [2024-11-10 14:35:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:52,588 INFO L124 PetriNetUnfolderBase]: 62/1750 cut-off events. [2024-11-10 14:35:52,588 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:35:52,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1750 events. 62/1750 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9936 event pairs, 20 based on Foata normal form. 0/1487 useless extension candidates. Maximal degree in co-relation 1768. Up to 50 conditions per place. [2024-11-10 14:35:52,612 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-11-10 14:35:52,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 576 transitions, 1190 flow [2024-11-10 14:35:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-10 14:35:52,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9484752891692955 [2024-11-10 14:35:52,616 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1162 flow. Second operand 3 states and 1804 transitions. [2024-11-10 14:35:52,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 576 transitions, 1190 flow [2024-11-10 14:35:52,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 576 transitions, 1189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:52,624 INFO L231 Difference]: Finished difference. Result has 571 places, 576 transitions, 1163 flow [2024-11-10 14:35:52,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1163, PETRI_PLACES=571, PETRI_TRANSITIONS=576} [2024-11-10 14:35:52,625 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2024-11-10 14:35:52,625 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 576 transitions, 1163 flow [2024-11-10 14:35:52,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:52,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:52,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:52,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:35:52,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:35:52,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1458466746, now seen corresponding path program 1 times [2024-11-10 14:35:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:52,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347534486] [2024-11-10 14:35:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347534486] [2024-11-10 14:35:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347534486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:53,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:53,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:35:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881653313] [2024-11-10 14:35:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:53,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:35:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:35:53,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:35:53,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 517 out of 634 [2024-11-10 14:35:53,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 576 transitions, 1163 flow. Second operand has 6 states, 6 states have (on average 518.5) internal successors, (3111), 6 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:53,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:53,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 517 of 634 [2024-11-10 14:35:53,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:00,711 INFO L124 PetriNetUnfolderBase]: 12107/56178 cut-off events. [2024-11-10 14:36:00,712 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-10 14:36:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73661 conditions, 56178 events. 12107/56178 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 785027 event pairs, 10080 based on Foata normal form. 0/48924 useless extension candidates. Maximal degree in co-relation 73612. Up to 17156 conditions per place. [2024-11-10 14:36:01,100 INFO L140 encePairwiseOnDemand]: 616/634 looper letters, 78 selfloop transitions, 15 changer transitions 0/573 dead transitions. [2024-11-10 14:36:01,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 573 transitions, 1343 flow [2024-11-10 14:36:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3198 transitions. [2024-11-10 14:36:01,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8406940063091483 [2024-11-10 14:36:01,105 INFO L175 Difference]: Start difference. First operand has 571 places, 576 transitions, 1163 flow. Second operand 6 states and 3198 transitions. [2024-11-10 14:36:01,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 573 transitions, 1343 flow [2024-11-10 14:36:01,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 573 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:01,114 INFO L231 Difference]: Finished difference. Result has 571 places, 573 transitions, 1183 flow [2024-11-10 14:36:01,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1183, PETRI_PLACES=571, PETRI_TRANSITIONS=573} [2024-11-10 14:36:01,116 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2024-11-10 14:36:01,117 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 573 transitions, 1183 flow [2024-11-10 14:36:01,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 518.5) internal successors, (3111), 6 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:01,119 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:01,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:36:01,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1427444175, now seen corresponding path program 1 times [2024-11-10 14:36:01,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:01,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273558566] [2024-11-10 14:36:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273558566] [2024-11-10 14:36:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273558566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:01,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231696295] [2024-11-10 14:36:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:01,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:01,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:01,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 634 [2024-11-10 14:36:01,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 573 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:01,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 634 [2024-11-10 14:36:01,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:01,516 INFO L124 PetriNetUnfolderBase]: 78/1638 cut-off events. [2024-11-10 14:36:01,517 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:36:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 1638 events. 78/1638 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9936 event pairs, 32 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 1708. Up to 87 conditions per place. [2024-11-10 14:36:01,541 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 16 selfloop transitions, 1 changer transitions 0/568 dead transitions. [2024-11-10 14:36:01,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 568 transitions, 1207 flow [2024-11-10 14:36:01,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-10 14:36:01,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9437434279705573 [2024-11-10 14:36:01,544 INFO L175 Difference]: Start difference. First operand has 571 places, 573 transitions, 1183 flow. Second operand 3 states and 1795 transitions. [2024-11-10 14:36:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 568 transitions, 1207 flow [2024-11-10 14:36:01,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 568 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:01,550 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1145 flow [2024-11-10 14:36:01,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1145, PETRI_PLACES=563, PETRI_TRANSITIONS=568} [2024-11-10 14:36:01,551 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2024-11-10 14:36:01,552 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1145 flow [2024-11-10 14:36:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,553 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:01,553 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:36:01,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1576845981, now seen corresponding path program 1 times [2024-11-10 14:36:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084862144] [2024-11-10 14:36:01,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084862144] [2024-11-10 14:36:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084862144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942344584] [2024-11-10 14:36:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:01,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:01,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:01,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 634 [2024-11-10 14:36:01,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 568 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:01,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 634 [2024-11-10 14:36:01,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:01,737 INFO L124 PetriNetUnfolderBase]: 36/1041 cut-off events. [2024-11-10 14:36:01,738 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:36:01,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 1041 events. 36/1041 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4406 event pairs, 12 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1042. Up to 38 conditions per place. [2024-11-10 14:36:01,752 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 13 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-11-10 14:36:01,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 567 transitions, 1173 flow [2024-11-10 14:36:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-10 14:36:01,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9484752891692955 [2024-11-10 14:36:01,756 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1145 flow. Second operand 3 states and 1804 transitions. [2024-11-10 14:36:01,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 567 transitions, 1173 flow [2024-11-10 14:36:01,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 567 transitions, 1172 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:01,762 INFO L231 Difference]: Finished difference. Result has 563 places, 567 transitions, 1146 flow [2024-11-10 14:36:01,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=563, PETRI_TRANSITIONS=567} [2024-11-10 14:36:01,763 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -27 predicate places. [2024-11-10 14:36:01,763 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 567 transitions, 1146 flow [2024-11-10 14:36:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:01,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:36:01,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1260222093, now seen corresponding path program 1 times [2024-11-10 14:36:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:01,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869770946] [2024-11-10 14:36:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:01,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:01,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869770946] [2024-11-10 14:36:01,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869770946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:01,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:01,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647710127] [2024-11-10 14:36:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:01,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:01,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 634 [2024-11-10 14:36:01,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 567 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:01,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 634 [2024-11-10 14:36:01,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:02,094 INFO L124 PetriNetUnfolderBase]: 136/2445 cut-off events. [2024-11-10 14:36:02,094 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-10 14:36:02,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 2445 events. 136/2445 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17740 event pairs, 64 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2551. Up to 141 conditions per place. [2024-11-10 14:36:02,136 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 16 selfloop transitions, 1 changer transitions 0/562 dead transitions. [2024-11-10 14:36:02,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 562 transitions, 1170 flow [2024-11-10 14:36:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2024-11-10 14:36:02,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9437434279705573 [2024-11-10 14:36:02,139 INFO L175 Difference]: Start difference. First operand has 563 places, 567 transitions, 1146 flow. Second operand 3 states and 1795 transitions. [2024-11-10 14:36:02,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 562 transitions, 1170 flow [2024-11-10 14:36:02,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 562 transitions, 1166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:02,145 INFO L231 Difference]: Finished difference. Result has 558 places, 562 transitions, 1134 flow [2024-11-10 14:36:02,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=558, PETRI_TRANSITIONS=562} [2024-11-10 14:36:02,146 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -32 predicate places. [2024-11-10 14:36:02,147 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 562 transitions, 1134 flow [2024-11-10 14:36:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:02,148 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:02,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:36:02,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1739386294, now seen corresponding path program 1 times [2024-11-10 14:36:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582683426] [2024-11-10 14:36:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:02,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582683426] [2024-11-10 14:36:02,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582683426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:02,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:02,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536270808] [2024-11-10 14:36:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:02,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:02,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 634 [2024-11-10 14:36:02,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 562 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:02,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 634 [2024-11-10 14:36:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:02,471 INFO L124 PetriNetUnfolderBase]: 38/813 cut-off events. [2024-11-10 14:36:02,474 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-10 14:36:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 813 events. 38/813 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3025 event pairs, 20 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 825. Up to 50 conditions per place. [2024-11-10 14:36:02,498 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 13 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2024-11-10 14:36:02,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 561 transitions, 1162 flow [2024-11-10 14:36:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-10 14:36:02,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9484752891692955 [2024-11-10 14:36:02,505 INFO L175 Difference]: Start difference. First operand has 558 places, 562 transitions, 1134 flow. Second operand 3 states and 1804 transitions. [2024-11-10 14:36:02,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 561 transitions, 1162 flow [2024-11-10 14:36:02,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:02,518 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1135 flow [2024-11-10 14:36:02,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2024-11-10 14:36:02,522 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -32 predicate places. [2024-11-10 14:36:02,522 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1135 flow [2024-11-10 14:36:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:02,524 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:36:02,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1717640480, now seen corresponding path program 1 times [2024-11-10 14:36:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62077440] [2024-11-10 14:36:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:02,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62077440] [2024-11-10 14:36:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62077440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:02,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:02,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072331325] [2024-11-10 14:36:02,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:02,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 634 [2024-11-10 14:36:02,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:02,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 634 [2024-11-10 14:36:02,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:02,727 INFO L124 PetriNetUnfolderBase]: 34/993 cut-off events. [2024-11-10 14:36:02,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:36:02,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 993 events. 34/993 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4370 event pairs, 6 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 997. Up to 23 conditions per place. [2024-11-10 14:36:02,738 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 12 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-11-10 14:36:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 562 transitions, 1167 flow [2024-11-10 14:36:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1815 transitions. [2024-11-10 14:36:02,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542586750788643 [2024-11-10 14:36:02,742 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1135 flow. Second operand 3 states and 1815 transitions. [2024-11-10 14:36:02,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 562 transitions, 1167 flow [2024-11-10 14:36:02,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 562 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:02,749 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1133 flow [2024-11-10 14:36:02,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1133, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2024-11-10 14:36:02,751 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -33 predicate places. [2024-11-10 14:36:02,751 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1133 flow [2024-11-10 14:36:02,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:02,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:02,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:36:02,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:02,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash -909532878, now seen corresponding path program 1 times [2024-11-10 14:36:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016838257] [2024-11-10 14:36:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016838257] [2024-11-10 14:36:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016838257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592924921] [2024-11-10 14:36:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:02,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:02,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1133 flow. Second operand has 3 states, 3 states have (on average 600.6666666666666) internal successors, (1802), 3 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:02,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:02,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:02,955 INFO L124 PetriNetUnfolderBase]: 31/879 cut-off events. [2024-11-10 14:36:02,956 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-10 14:36:02,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 879 events. 31/879 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3412 event pairs, 6 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 879. Up to 24 conditions per place. [2024-11-10 14:36:02,968 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 13 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2024-11-10 14:36:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 561 transitions, 1167 flow [2024-11-10 14:36:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1813 transitions. [2024-11-10 14:36:02,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9532071503680336 [2024-11-10 14:36:02,971 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1133 flow. Second operand 3 states and 1813 transitions. [2024-11-10 14:36:02,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 561 transitions, 1167 flow [2024-11-10 14:36:02,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 561 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:02,978 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1131 flow [2024-11-10 14:36:02,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1131, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2024-11-10 14:36:02,979 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -34 predicate places. [2024-11-10 14:36:02,979 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1131 flow [2024-11-10 14:36:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.6666666666666) internal successors, (1802), 3 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:02,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:02,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:36:02,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:02,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2099930286, now seen corresponding path program 1 times [2024-11-10 14:36:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826669105] [2024-11-10 14:36:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826669105] [2024-11-10 14:36:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826669105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:36:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918087495] [2024-11-10 14:36:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:03,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:03,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:03,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:03,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 600.6666666666666) internal successors, (1802), 3 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:03,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:03,227 INFO L124 PetriNetUnfolderBase]: 40/994 cut-off events. [2024-11-10 14:36:03,227 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-10 14:36:03,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 994 events. 40/994 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4324 event pairs, 12 based on Foata normal form. 1/882 useless extension candidates. Maximal degree in co-relation 1025. Up to 39 conditions per place. [2024-11-10 14:36:03,234 INFO L140 encePairwiseOnDemand]: 630/634 looper letters, 14 selfloop transitions, 3 changer transitions 0/562 dead transitions. [2024-11-10 14:36:03,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 562 transitions, 1173 flow [2024-11-10 14:36:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1815 transitions. [2024-11-10 14:36:03,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542586750788643 [2024-11-10 14:36:03,237 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1131 flow. Second operand 3 states and 1815 transitions. [2024-11-10 14:36:03,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 562 transitions, 1173 flow [2024-11-10 14:36:03,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1169 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:03,245 INFO L231 Difference]: Finished difference. Result has 558 places, 560 transitions, 1145 flow [2024-11-10 14:36:03,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1145, PETRI_PLACES=558, PETRI_TRANSITIONS=560} [2024-11-10 14:36:03,247 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -32 predicate places. [2024-11-10 14:36:03,248 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 560 transitions, 1145 flow [2024-11-10 14:36:03,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.6666666666666) internal successors, (1802), 3 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:03,249 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:03,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:36:03,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:03,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:03,249 INFO L85 PathProgramCache]: Analyzing trace with hash -779094033, now seen corresponding path program 1 times [2024-11-10 14:36:03,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:03,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374641578] [2024-11-10 14:36:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:03,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:03,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:03,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374641578] [2024-11-10 14:36:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374641578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45507445] [2024-11-10 14:36:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:03,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:03,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:03,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 634 [2024-11-10 14:36:03,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 560 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:03,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 634 [2024-11-10 14:36:03,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:03,523 INFO L124 PetriNetUnfolderBase]: 131/2149 cut-off events. [2024-11-10 14:36:03,523 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-10 14:36:03,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 2149 events. 131/2149 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14819 event pairs, 24 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 2346. Up to 154 conditions per place. [2024-11-10 14:36:03,550 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 20 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-10 14:36:03,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 563 transitions, 1200 flow [2024-11-10 14:36:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2024-11-10 14:36:03,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9505783385909569 [2024-11-10 14:36:03,555 INFO L175 Difference]: Start difference. First operand has 558 places, 560 transitions, 1145 flow. Second operand 3 states and 1808 transitions. [2024-11-10 14:36:03,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 563 transitions, 1200 flow [2024-11-10 14:36:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:03,562 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1145 flow [2024-11-10 14:36:03,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1145, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2024-11-10 14:36:03,562 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -35 predicate places. [2024-11-10 14:36:03,563 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1145 flow [2024-11-10 14:36:03,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:03,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:36:03,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2076641656, now seen corresponding path program 1 times [2024-11-10 14:36:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814648303] [2024-11-10 14:36:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814648303] [2024-11-10 14:36:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814648303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:03,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106560628] [2024-11-10 14:36:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:03,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:03,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1145 flow. Second operand has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:03,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:03,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:03,743 INFO L124 PetriNetUnfolderBase]: 63/1140 cut-off events. [2024-11-10 14:36:03,743 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2024-11-10 14:36:03,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1140 events. 63/1140 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5477 event pairs, 12 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 1190. Up to 49 conditions per place. [2024-11-10 14:36:03,756 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 13 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-10 14:36:03,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1179 flow [2024-11-10 14:36:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1813 transitions. [2024-11-10 14:36:03,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9532071503680336 [2024-11-10 14:36:03,759 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1145 flow. Second operand 3 states and 1813 transitions. [2024-11-10 14:36:03,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1179 flow [2024-11-10 14:36:03,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1179 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:03,765 INFO L231 Difference]: Finished difference. Result has 556 places, 557 transitions, 1147 flow [2024-11-10 14:36:03,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=556, PETRI_TRANSITIONS=557} [2024-11-10 14:36:03,766 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -34 predicate places. [2024-11-10 14:36:03,766 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 557 transitions, 1147 flow [2024-11-10 14:36:03,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:03,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:03,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:03,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:36:03,768 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:03,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1965890066, now seen corresponding path program 1 times [2024-11-10 14:36:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:03,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837245835] [2024-11-10 14:36:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837245835] [2024-11-10 14:36:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837245835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258943736] [2024-11-10 14:36:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:03,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:04,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:04,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 557 transitions, 1147 flow. Second operand has 8 states, 8 states have (on average 572.125) internal successors, (4577), 8 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:04,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:04,504 INFO L124 PetriNetUnfolderBase]: 98/1583 cut-off events. [2024-11-10 14:36:04,504 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2024-11-10 14:36:04,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1583 events. 98/1583 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8586 event pairs, 35 based on Foata normal form. 6/1455 useless extension candidates. Maximal degree in co-relation 1899. Up to 124 conditions per place. [2024-11-10 14:36:04,523 INFO L140 encePairwiseOnDemand]: 618/634 looper letters, 68 selfloop transitions, 18 changer transitions 0/597 dead transitions. [2024-11-10 14:36:04,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 597 transitions, 1417 flow [2024-11-10 14:36:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:36:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:36:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6903 transitions. [2024-11-10 14:36:04,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9073343848580442 [2024-11-10 14:36:04,534 INFO L175 Difference]: Start difference. First operand has 556 places, 557 transitions, 1147 flow. Second operand 12 states and 6903 transitions. [2024-11-10 14:36:04,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 597 transitions, 1417 flow [2024-11-10 14:36:04,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 597 transitions, 1413 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:04,540 INFO L231 Difference]: Finished difference. Result has 571 places, 566 transitions, 1236 flow [2024-11-10 14:36:04,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1236, PETRI_PLACES=571, PETRI_TRANSITIONS=566} [2024-11-10 14:36:04,541 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -19 predicate places. [2024-11-10 14:36:04,541 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 566 transitions, 1236 flow [2024-11-10 14:36:04,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.125) internal successors, (4577), 8 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:04,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:36:04,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1234893804, now seen corresponding path program 1 times [2024-11-10 14:36:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145164852] [2024-11-10 14:36:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:04,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145164852] [2024-11-10 14:36:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145164852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:04,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:04,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:36:04,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314268540] [2024-11-10 14:36:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:04,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:04,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:04,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 566 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:04,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:04,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:04,787 INFO L124 PetriNetUnfolderBase]: 132/1842 cut-off events. [2024-11-10 14:36:04,787 INFO L125 PetriNetUnfolderBase]: For 103/166 co-relation queries the response was YES. [2024-11-10 14:36:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 1842 events. 132/1842 cut-off events. For 103/166 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10991 event pairs, 48 based on Foata normal form. 0/1627 useless extension candidates. Maximal degree in co-relation 2082. Up to 149 conditions per place. [2024-11-10 14:36:04,810 INFO L140 encePairwiseOnDemand]: 630/634 looper letters, 14 selfloop transitions, 3 changer transitions 0/569 dead transitions. [2024-11-10 14:36:04,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 569 transitions, 1278 flow [2024-11-10 14:36:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1815 transitions. [2024-11-10 14:36:04,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542586750788643 [2024-11-10 14:36:04,813 INFO L175 Difference]: Start difference. First operand has 571 places, 566 transitions, 1236 flow. Second operand 3 states and 1815 transitions. [2024-11-10 14:36:04,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 569 transitions, 1278 flow [2024-11-10 14:36:04,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 569 transitions, 1278 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:04,819 INFO L231 Difference]: Finished difference. Result has 575 places, 567 transitions, 1254 flow [2024-11-10 14:36:04,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1254, PETRI_PLACES=575, PETRI_TRANSITIONS=567} [2024-11-10 14:36:04,820 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -15 predicate places. [2024-11-10 14:36:04,820 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 567 transitions, 1254 flow [2024-11-10 14:36:04,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:04,821 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:36:04,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1196001582, now seen corresponding path program 1 times [2024-11-10 14:36:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701645443] [2024-11-10 14:36:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701645443] [2024-11-10 14:36:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701645443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:36:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972118525] [2024-11-10 14:36:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:04,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:04,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:04,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 567 transitions, 1254 flow. Second operand has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:04,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:04,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:05,213 INFO L124 PetriNetUnfolderBase]: 137/1991 cut-off events. [2024-11-10 14:36:05,213 INFO L125 PetriNetUnfolderBase]: For 84/117 co-relation queries the response was YES. [2024-11-10 14:36:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1991 events. 137/1991 cut-off events. For 84/117 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13035 event pairs, 48 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2332. Up to 152 conditions per place. [2024-11-10 14:36:05,249 INFO L140 encePairwiseOnDemand]: 630/634 looper letters, 14 selfloop transitions, 3 changer transitions 0/570 dead transitions. [2024-11-10 14:36:05,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 570 transitions, 1296 flow [2024-11-10 14:36:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1815 transitions. [2024-11-10 14:36:05,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542586750788643 [2024-11-10 14:36:05,252 INFO L175 Difference]: Start difference. First operand has 575 places, 567 transitions, 1254 flow. Second operand 3 states and 1815 transitions. [2024-11-10 14:36:05,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 570 transitions, 1296 flow [2024-11-10 14:36:05,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 570 transitions, 1290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:05,260 INFO L231 Difference]: Finished difference. Result has 577 places, 568 transitions, 1266 flow [2024-11-10 14:36:05,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=577, PETRI_TRANSITIONS=568} [2024-11-10 14:36:05,261 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -13 predicate places. [2024-11-10 14:36:05,261 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 568 transitions, 1266 flow [2024-11-10 14:36:05,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:05,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:05,261 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:05,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:36:05,262 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1276924905, now seen corresponding path program 1 times [2024-11-10 14:36:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731353274] [2024-11-10 14:36:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:05,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731353274] [2024-11-10 14:36:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731353274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:05,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836921267] [2024-11-10 14:36:05,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:05,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:05,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 634 [2024-11-10 14:36:05,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 568 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:05,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:05,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 634 [2024-11-10 14:36:05,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:05,883 INFO L124 PetriNetUnfolderBase]: 187/3289 cut-off events. [2024-11-10 14:36:05,883 INFO L125 PetriNetUnfolderBase]: For 98/116 co-relation queries the response was YES. [2024-11-10 14:36:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3853 conditions, 3289 events. 187/3289 cut-off events. For 98/116 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 25072 event pairs, 33 based on Foata normal form. 0/2978 useless extension candidates. Maximal degree in co-relation 3790. Up to 220 conditions per place. [2024-11-10 14:36:05,935 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-11-10 14:36:05,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 571 transitions, 1321 flow [2024-11-10 14:36:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2024-11-10 14:36:05,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9505783385909569 [2024-11-10 14:36:05,939 INFO L175 Difference]: Start difference. First operand has 577 places, 568 transitions, 1266 flow. Second operand 3 states and 1808 transitions. [2024-11-10 14:36:05,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 571 transitions, 1321 flow [2024-11-10 14:36:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 571 transitions, 1315 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:05,948 INFO L231 Difference]: Finished difference. Result has 574 places, 566 transitions, 1266 flow [2024-11-10 14:36:05,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=574, PETRI_TRANSITIONS=566} [2024-11-10 14:36:05,948 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -16 predicate places. [2024-11-10 14:36:05,949 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 566 transitions, 1266 flow [2024-11-10 14:36:05,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:05,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:05,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:05,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:36:05,950 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:05,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1023096508, now seen corresponding path program 1 times [2024-11-10 14:36:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:05,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889216687] [2024-11-10 14:36:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889216687] [2024-11-10 14:36:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889216687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:06,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753104468] [2024-11-10 14:36:06,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:06,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:06,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:06,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:06,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 566 transitions, 1266 flow. Second operand has 8 states, 8 states have (on average 572.25) internal successors, (4578), 8 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:06,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:07,134 INFO L124 PetriNetUnfolderBase]: 170/2430 cut-off events. [2024-11-10 14:36:07,134 INFO L125 PetriNetUnfolderBase]: For 100/152 co-relation queries the response was YES. [2024-11-10 14:36:07,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 2430 events. 170/2430 cut-off events. For 100/152 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16165 event pairs, 79 based on Foata normal form. 3/2196 useless extension candidates. Maximal degree in co-relation 2983. Up to 259 conditions per place. [2024-11-10 14:36:07,175 INFO L140 encePairwiseOnDemand]: 620/634 looper letters, 69 selfloop transitions, 15 changer transitions 0/599 dead transitions. [2024-11-10 14:36:07,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 599 transitions, 1516 flow [2024-11-10 14:36:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:36:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:36:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6332 transitions. [2024-11-10 14:36:07,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079437912245483 [2024-11-10 14:36:07,184 INFO L175 Difference]: Start difference. First operand has 574 places, 566 transitions, 1266 flow. Second operand 11 states and 6332 transitions. [2024-11-10 14:36:07,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 599 transitions, 1516 flow [2024-11-10 14:36:07,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 599 transitions, 1516 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:07,192 INFO L231 Difference]: Finished difference. Result has 587 places, 569 transitions, 1321 flow [2024-11-10 14:36:07,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1321, PETRI_PLACES=587, PETRI_TRANSITIONS=569} [2024-11-10 14:36:07,193 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -3 predicate places. [2024-11-10 14:36:07,193 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 569 transitions, 1321 flow [2024-11-10 14:36:07,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.25) internal successors, (4578), 8 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:07,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:07,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:36:07,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -931998086, now seen corresponding path program 1 times [2024-11-10 14:36:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637435055] [2024-11-10 14:36:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:07,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637435055] [2024-11-10 14:36:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637435055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:07,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574046995] [2024-11-10 14:36:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:07,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:07,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:07,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:07,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 569 transitions, 1321 flow. Second operand has 8 states, 8 states have (on average 572.375) internal successors, (4579), 8 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:07,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:07,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:07,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:08,484 INFO L124 PetriNetUnfolderBase]: 245/3048 cut-off events. [2024-11-10 14:36:08,485 INFO L125 PetriNetUnfolderBase]: For 245/338 co-relation queries the response was YES. [2024-11-10 14:36:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 3048 events. 245/3048 cut-off events. For 245/338 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 23039 event pairs, 110 based on Foata normal form. 10/2774 useless extension candidates. Maximal degree in co-relation 3856. Up to 347 conditions per place. [2024-11-10 14:36:08,534 INFO L140 encePairwiseOnDemand]: 620/634 looper letters, 65 selfloop transitions, 15 changer transitions 0/598 dead transitions. [2024-11-10 14:36:08,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 598 transitions, 1555 flow [2024-11-10 14:36:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:36:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:36:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6323 transitions. [2024-11-10 14:36:08,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066532836248925 [2024-11-10 14:36:08,543 INFO L175 Difference]: Start difference. First operand has 587 places, 569 transitions, 1321 flow. Second operand 11 states and 6323 transitions. [2024-11-10 14:36:08,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 598 transitions, 1555 flow [2024-11-10 14:36:08,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 598 transitions, 1534 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:36:08,552 INFO L231 Difference]: Finished difference. Result has 595 places, 577 transitions, 1376 flow [2024-11-10 14:36:08,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1376, PETRI_PLACES=595, PETRI_TRANSITIONS=577} [2024-11-10 14:36:08,553 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 5 predicate places. [2024-11-10 14:36:08,553 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 577 transitions, 1376 flow [2024-11-10 14:36:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.375) internal successors, (4579), 8 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:08,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:08,555 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:36:08,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1809363354, now seen corresponding path program 1 times [2024-11-10 14:36:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849630806] [2024-11-10 14:36:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:36:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849630806] [2024-11-10 14:36:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849630806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:08,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640649219] [2024-11-10 14:36:08,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:09,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:09,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 577 transitions, 1376 flow. Second operand has 8 states, 8 states have (on average 572.25) internal successors, (4578), 8 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:09,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:09,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:09,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:09,702 INFO L124 PetriNetUnfolderBase]: 147/2390 cut-off events. [2024-11-10 14:36:09,703 INFO L125 PetriNetUnfolderBase]: For 177/231 co-relation queries the response was YES. [2024-11-10 14:36:09,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 2390 events. 147/2390 cut-off events. For 177/231 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 15107 event pairs, 55 based on Foata normal form. 5/2242 useless extension candidates. Maximal degree in co-relation 3227. Up to 233 conditions per place. [2024-11-10 14:36:09,734 INFO L140 encePairwiseOnDemand]: 619/634 looper letters, 72 selfloop transitions, 19 changer transitions 0/608 dead transitions. [2024-11-10 14:36:09,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 608 transitions, 1671 flow [2024-11-10 14:36:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:36:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:36:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6325 transitions. [2024-11-10 14:36:09,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069400630914827 [2024-11-10 14:36:09,742 INFO L175 Difference]: Start difference. First operand has 595 places, 577 transitions, 1376 flow. Second operand 11 states and 6325 transitions. [2024-11-10 14:36:09,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 608 transitions, 1671 flow [2024-11-10 14:36:09,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 608 transitions, 1667 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:09,751 INFO L231 Difference]: Finished difference. Result has 607 places, 584 transitions, 1483 flow [2024-11-10 14:36:09,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1483, PETRI_PLACES=607, PETRI_TRANSITIONS=584} [2024-11-10 14:36:09,752 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 17 predicate places. [2024-11-10 14:36:09,752 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 584 transitions, 1483 flow [2024-11-10 14:36:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.25) internal successors, (4578), 8 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:09,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:09,753 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:36:09,754 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1578331800, now seen corresponding path program 1 times [2024-11-10 14:36:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120185612] [2024-11-10 14:36:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:36:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120185612] [2024-11-10 14:36:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120185612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739637559] [2024-11-10 14:36:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:10,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:10,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 584 transitions, 1483 flow. Second operand has 8 states, 8 states have (on average 572.375) internal successors, (4579), 8 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:10,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:10,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:10,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:11,516 INFO L124 PetriNetUnfolderBase]: 312/4299 cut-off events. [2024-11-10 14:36:11,516 INFO L125 PetriNetUnfolderBase]: For 506/618 co-relation queries the response was YES. [2024-11-10 14:36:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5918 conditions, 4299 events. 312/4299 cut-off events. For 506/618 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 35195 event pairs, 133 based on Foata normal form. 4/3957 useless extension candidates. Maximal degree in co-relation 5834. Up to 453 conditions per place. [2024-11-10 14:36:11,558 INFO L140 encePairwiseOnDemand]: 619/634 looper letters, 67 selfloop transitions, 18 changer transitions 0/610 dead transitions. [2024-11-10 14:36:11,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 610 transitions, 1745 flow [2024-11-10 14:36:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:36:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:36:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6316 transitions. [2024-11-10 14:36:11,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056495554918268 [2024-11-10 14:36:11,564 INFO L175 Difference]: Start difference. First operand has 607 places, 584 transitions, 1483 flow. Second operand 11 states and 6316 transitions. [2024-11-10 14:36:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 610 transitions, 1745 flow [2024-11-10 14:36:11,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 610 transitions, 1724 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:36:11,575 INFO L231 Difference]: Finished difference. Result has 615 places, 595 transitions, 1578 flow [2024-11-10 14:36:11,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1578, PETRI_PLACES=615, PETRI_TRANSITIONS=595} [2024-11-10 14:36:11,575 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 25 predicate places. [2024-11-10 14:36:11,576 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 595 transitions, 1578 flow [2024-11-10 14:36:11,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.375) internal successors, (4579), 8 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:11,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:11,577 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:36:11,577 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:11,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 283511695, now seen corresponding path program 1 times [2024-11-10 14:36:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878549074] [2024-11-10 14:36:11,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:36:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878549074] [2024-11-10 14:36:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878549074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:36:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706615504] [2024-11-10 14:36:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:36:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:36:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:12,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 634 [2024-11-10 14:36:12,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 595 transitions, 1578 flow. Second operand has 8 states, 8 states have (on average 572.5) internal successors, (4580), 8 states have internal predecessors, (4580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:12,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:12,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 634 [2024-11-10 14:36:12,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:13,034 INFO L124 PetriNetUnfolderBase]: 296/3591 cut-off events. [2024-11-10 14:36:13,035 INFO L125 PetriNetUnfolderBase]: For 691/750 co-relation queries the response was YES. [2024-11-10 14:36:13,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 3591 events. 296/3591 cut-off events. For 691/750 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 28564 event pairs, 153 based on Foata normal form. 0/3319 useless extension candidates. Maximal degree in co-relation 5053. Up to 433 conditions per place. [2024-11-10 14:36:13,087 INFO L140 encePairwiseOnDemand]: 619/634 looper letters, 67 selfloop transitions, 18 changer transitions 0/616 dead transitions. [2024-11-10 14:36:13,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 616 transitions, 1830 flow [2024-11-10 14:36:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:36:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:36:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6316 transitions. [2024-11-10 14:36:13,092 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056495554918268 [2024-11-10 14:36:13,092 INFO L175 Difference]: Start difference. First operand has 615 places, 595 transitions, 1578 flow. Second operand 11 states and 6316 transitions. [2024-11-10 14:36:13,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 616 transitions, 1830 flow [2024-11-10 14:36:13,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 616 transitions, 1826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:13,104 INFO L231 Difference]: Finished difference. Result has 627 places, 601 transitions, 1669 flow [2024-11-10 14:36:13,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1669, PETRI_PLACES=627, PETRI_TRANSITIONS=601} [2024-11-10 14:36:13,105 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 37 predicate places. [2024-11-10 14:36:13,105 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 601 transitions, 1669 flow [2024-11-10 14:36:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 572.5) internal successors, (4580), 8 states have internal predecessors, (4580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:13,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:13,107 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:36:13,107 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1553034501, now seen corresponding path program 1 times [2024-11-10 14:36:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032457096] [2024-11-10 14:36:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032457096] [2024-11-10 14:36:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032457096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798229529] [2024-11-10 14:36:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:14,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:14,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 601 transitions, 1669 flow. Second operand has 6 states, 6 states have (on average 581.8333333333334) internal successors, (3491), 6 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:14,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:14,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:14,908 INFO L124 PetriNetUnfolderBase]: 157/3552 cut-off events. [2024-11-10 14:36:14,908 INFO L125 PetriNetUnfolderBase]: For 712/756 co-relation queries the response was YES. [2024-11-10 14:36:14,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 3552 events. 157/3552 cut-off events. For 712/756 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 25804 event pairs, 22 based on Foata normal form. 12/3352 useless extension candidates. Maximal degree in co-relation 4994. Up to 173 conditions per place. [2024-11-10 14:36:14,959 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 41 selfloop transitions, 5 changer transitions 0/610 dead transitions. [2024-11-10 14:36:14,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 610 transitions, 1790 flow [2024-11-10 14:36:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3519 transitions. [2024-11-10 14:36:14,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9250788643533123 [2024-11-10 14:36:14,963 INFO L175 Difference]: Start difference. First operand has 627 places, 601 transitions, 1669 flow. Second operand 6 states and 3519 transitions. [2024-11-10 14:36:14,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 610 transitions, 1790 flow [2024-11-10 14:36:14,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 610 transitions, 1769 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:36:14,975 INFO L231 Difference]: Finished difference. Result has 623 places, 599 transitions, 1654 flow [2024-11-10 14:36:14,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=623, PETRI_TRANSITIONS=599} [2024-11-10 14:36:14,976 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 33 predicate places. [2024-11-10 14:36:14,976 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 599 transitions, 1654 flow [2024-11-10 14:36:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.8333333333334) internal successors, (3491), 6 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:14,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:14,977 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:36:14,978 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:14,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2007176820, now seen corresponding path program 1 times [2024-11-10 14:36:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686223196] [2024-11-10 14:36:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686223196] [2024-11-10 14:36:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686223196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246450552] [2024-11-10 14:36:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:16,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:16,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 599 transitions, 1654 flow. Second operand has 6 states, 6 states have (on average 582.0) internal successors, (3492), 6 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:16,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:16,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:16,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:16,902 INFO L124 PetriNetUnfolderBase]: 186/3909 cut-off events. [2024-11-10 14:36:16,903 INFO L125 PetriNetUnfolderBase]: For 699/797 co-relation queries the response was YES. [2024-11-10 14:36:16,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 3909 events. 186/3909 cut-off events. For 699/797 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 30217 event pairs, 30 based on Foata normal form. 8/3665 useless extension candidates. Maximal degree in co-relation 5376. Up to 197 conditions per place. [2024-11-10 14:36:16,971 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 40 selfloop transitions, 5 changer transitions 0/607 dead transitions. [2024-11-10 14:36:16,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 607 transitions, 1770 flow [2024-11-10 14:36:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3518 transitions. [2024-11-10 14:36:16,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9248159831756047 [2024-11-10 14:36:16,975 INFO L175 Difference]: Start difference. First operand has 623 places, 599 transitions, 1654 flow. Second operand 6 states and 3518 transitions. [2024-11-10 14:36:16,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 607 transitions, 1770 flow [2024-11-10 14:36:16,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 607 transitions, 1760 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:16,989 INFO L231 Difference]: Finished difference. Result has 621 places, 597 transitions, 1650 flow [2024-11-10 14:36:16,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1650, PETRI_PLACES=621, PETRI_TRANSITIONS=597} [2024-11-10 14:36:16,991 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 31 predicate places. [2024-11-10 14:36:16,991 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 597 transitions, 1650 flow [2024-11-10 14:36:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.0) internal successors, (3492), 6 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:16,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:16,992 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:16,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:36:16,997 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1406703521, now seen corresponding path program 1 times [2024-11-10 14:36:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519533121] [2024-11-10 14:36:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519533121] [2024-11-10 14:36:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519533121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444041459] [2024-11-10 14:36:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:17,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:17,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:18,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:18,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 597 transitions, 1650 flow. Second operand has 6 states, 6 states have (on average 581.8333333333334) internal successors, (3491), 6 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:18,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:18,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:18,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:18,924 INFO L124 PetriNetUnfolderBase]: 134/3619 cut-off events. [2024-11-10 14:36:18,924 INFO L125 PetriNetUnfolderBase]: For 682/755 co-relation queries the response was YES. [2024-11-10 14:36:18,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 3619 events. 134/3619 cut-off events. For 682/755 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 26149 event pairs, 22 based on Foata normal form. 11/3423 useless extension candidates. Maximal degree in co-relation 4998. Up to 183 conditions per place. [2024-11-10 14:36:18,972 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 41 selfloop transitions, 5 changer transitions 0/606 dead transitions. [2024-11-10 14:36:18,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 606 transitions, 1771 flow [2024-11-10 14:36:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3519 transitions. [2024-11-10 14:36:18,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9250788643533123 [2024-11-10 14:36:18,974 INFO L175 Difference]: Start difference. First operand has 621 places, 597 transitions, 1650 flow. Second operand 6 states and 3519 transitions. [2024-11-10 14:36:18,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 606 transitions, 1771 flow [2024-11-10 14:36:18,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 606 transitions, 1761 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:18,985 INFO L231 Difference]: Finished difference. Result has 619 places, 595 transitions, 1646 flow [2024-11-10 14:36:18,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1646, PETRI_PLACES=619, PETRI_TRANSITIONS=595} [2024-11-10 14:36:18,986 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 29 predicate places. [2024-11-10 14:36:18,986 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 595 transitions, 1646 flow [2024-11-10 14:36:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.8333333333334) internal successors, (3491), 6 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:18,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:18,987 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:18,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:36:18,987 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:18,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 456652757, now seen corresponding path program 1 times [2024-11-10 14:36:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600489928] [2024-11-10 14:36:18,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600489928] [2024-11-10 14:36:19,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600489928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:19,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:19,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328562362] [2024-11-10 14:36:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:19,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:19,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 634 [2024-11-10 14:36:19,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 595 transitions, 1646 flow. Second operand has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:19,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:19,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 634 [2024-11-10 14:36:19,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:19,990 INFO L124 PetriNetUnfolderBase]: 411/6729 cut-off events. [2024-11-10 14:36:19,990 INFO L125 PetriNetUnfolderBase]: For 565/593 co-relation queries the response was YES. [2024-11-10 14:36:20,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 6729 events. 411/6729 cut-off events. For 565/593 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 61569 event pairs, 63 based on Foata normal form. 0/6216 useless extension candidates. Maximal degree in co-relation 8382. Up to 469 conditions per place. [2024-11-10 14:36:20,083 INFO L140 encePairwiseOnDemand]: 628/634 looper letters, 19 selfloop transitions, 2 changer transitions 0/597 dead transitions. [2024-11-10 14:36:20,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 597 transitions, 1696 flow [2024-11-10 14:36:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1807 transitions. [2024-11-10 14:36:20,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9500525762355415 [2024-11-10 14:36:20,085 INFO L175 Difference]: Start difference. First operand has 619 places, 595 transitions, 1646 flow. Second operand 3 states and 1807 transitions. [2024-11-10 14:36:20,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 597 transitions, 1696 flow [2024-11-10 14:36:20,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 597 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:20,096 INFO L231 Difference]: Finished difference. Result has 613 places, 593 transitions, 1642 flow [2024-11-10 14:36:20,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=613, PETRI_TRANSITIONS=593} [2024-11-10 14:36:20,097 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 23 predicate places. [2024-11-10 14:36:20,097 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 593 transitions, 1642 flow [2024-11-10 14:36:20,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:20,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:20,097 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:36:20,098 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:20,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -129254293, now seen corresponding path program 1 times [2024-11-10 14:36:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968369031] [2024-11-10 14:36:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968369031] [2024-11-10 14:36:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968369031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716073300] [2024-11-10 14:36:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:20,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:20,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:20,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 593 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 582.1666666666666) internal successors, (3493), 6 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:20,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:20,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:20,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:21,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][485], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 665#true, 473#L105true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 848#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0), 844#(= |#race~a3~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), 625#(= |#race~n1~0| 0), Black: 806#(<= ~n3~0 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), 175#L79-16true, Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:21,508 INFO L294 olderBase$Statistics]: this new event has 341 ancestors and is cut-off event [2024-11-10 14:36:21,508 INFO L297 olderBase$Statistics]: existing Event has 341 ancestors and is cut-off event [2024-11-10 14:36:21,509 INFO L297 olderBase$Statistics]: existing Event has 341 ancestors and is cut-off event [2024-11-10 14:36:21,509 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2024-11-10 14:36:21,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][490], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 473#L105true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 554#L79-15true, 849#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), 625#(= |#race~n1~0| 0), Black: 806#(<= ~n3~0 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:21,514 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-10 14:36:21,514 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-10 14:36:21,514 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-10 14:36:21,514 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-10 14:36:21,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][496], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 473#L105true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 333#L79-14true, Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 850#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), 625#(= |#race~n1~0| 0), Black: 806#(<= ~n3~0 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:21,518 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-10 14:36:21,518 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-10 14:36:21,519 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:36:21,519 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-10 14:36:21,522 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][500], [Black: 701#true, 851#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 312#L79-13true, 643#(= |#race~n3~0| 0), Black: 842#true, 473#L105true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), 625#(= |#race~n1~0| 0), Black: 806#(<= ~n3~0 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:21,522 INFO L294 olderBase$Statistics]: this new event has 344 ancestors and is cut-off event [2024-11-10 14:36:21,522 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2024-11-10 14:36:21,522 INFO L297 olderBase$Statistics]: existing Event has 344 ancestors and is cut-off event [2024-11-10 14:36:21,522 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2024-11-10 14:36:21,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][500], [Black: 701#true, 851#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 473#L105true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), 625#(= |#race~n1~0| 0), Black: 806#(<= ~n3~0 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), 367#L79-12true, Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:21,525 INFO L294 olderBase$Statistics]: this new event has 345 ancestors and is cut-off event [2024-11-10 14:36:21,525 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-10 14:36:21,525 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-10 14:36:21,526 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-10 14:36:21,584 INFO L124 PetriNetUnfolderBase]: 260/4229 cut-off events. [2024-11-10 14:36:21,585 INFO L125 PetriNetUnfolderBase]: For 827/871 co-relation queries the response was YES. [2024-11-10 14:36:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 4229 events. 260/4229 cut-off events. For 827/871 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 34250 event pairs, 32 based on Foata normal form. 8/4031 useless extension candidates. Maximal degree in co-relation 5855. Up to 200 conditions per place. [2024-11-10 14:36:21,643 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 39 selfloop transitions, 5 changer transitions 0/600 dead transitions. [2024-11-10 14:36:21,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 600 transitions, 1753 flow [2024-11-10 14:36:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3517 transitions. [2024-11-10 14:36:21,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.924553101997897 [2024-11-10 14:36:21,645 INFO L175 Difference]: Start difference. First operand has 613 places, 593 transitions, 1642 flow. Second operand 6 states and 3517 transitions. [2024-11-10 14:36:21,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 600 transitions, 1753 flow [2024-11-10 14:36:21,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 600 transitions, 1753 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:21,657 INFO L231 Difference]: Finished difference. Result has 616 places, 591 transitions, 1648 flow [2024-11-10 14:36:21,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1648, PETRI_PLACES=616, PETRI_TRANSITIONS=591} [2024-11-10 14:36:21,658 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 26 predicate places. [2024-11-10 14:36:21,658 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 591 transitions, 1648 flow [2024-11-10 14:36:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.1666666666666) internal successors, (3493), 6 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:21,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:21,660 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:36:21,661 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:21,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1574767704, now seen corresponding path program 1 times [2024-11-10 14:36:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747509161] [2024-11-10 14:36:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747509161] [2024-11-10 14:36:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747509161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:22,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112433099] [2024-11-10 14:36:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:22,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:22,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:22,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 591 transitions, 1648 flow. Second operand has 6 states, 6 states have (on average 582.0) internal successors, (3492), 6 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:22,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:22,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:22,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:23,230 INFO L124 PetriNetUnfolderBase]: 195/4273 cut-off events. [2024-11-10 14:36:23,231 INFO L125 PetriNetUnfolderBase]: For 684/776 co-relation queries the response was YES. [2024-11-10 14:36:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5943 conditions, 4273 events. 195/4273 cut-off events. For 684/776 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 33716 event pairs, 29 based on Foata normal form. 7/4074 useless extension candidates. Maximal degree in co-relation 5848. Up to 196 conditions per place. [2024-11-10 14:36:23,298 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 40 selfloop transitions, 5 changer transitions 0/599 dead transitions. [2024-11-10 14:36:23,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 599 transitions, 1764 flow [2024-11-10 14:36:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3518 transitions. [2024-11-10 14:36:23,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9248159831756047 [2024-11-10 14:36:23,301 INFO L175 Difference]: Start difference. First operand has 616 places, 591 transitions, 1648 flow. Second operand 6 states and 3518 transitions. [2024-11-10 14:36:23,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 599 transitions, 1764 flow [2024-11-10 14:36:23,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 599 transitions, 1754 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:23,319 INFO L231 Difference]: Finished difference. Result has 614 places, 589 transitions, 1644 flow [2024-11-10 14:36:23,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1644, PETRI_PLACES=614, PETRI_TRANSITIONS=589} [2024-11-10 14:36:23,323 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 24 predicate places. [2024-11-10 14:36:23,324 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 589 transitions, 1644 flow [2024-11-10 14:36:23,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.0) internal successors, (3492), 6 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:23,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:23,324 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:23,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:36:23,325 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -788254586, now seen corresponding path program 1 times [2024-11-10 14:36:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123708860] [2024-11-10 14:36:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123708860] [2024-11-10 14:36:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123708860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853368415] [2024-11-10 14:36:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:23,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 634 [2024-11-10 14:36:23,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 589 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 605.0) internal successors, (1815), 3 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:23,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:23,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 634 [2024-11-10 14:36:23,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:24,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1620] thread3EXIT-->L107-5: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), 225#L107-5true, Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), 852#true, Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 660#(= |#race~a1~0| 0), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), 637#(= |#race~n2~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 806#(<= ~n3~0 0), 625#(= |#race~n1~0| 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 858#true, 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:24,087 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is not cut-off event [2024-11-10 14:36:24,087 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is not cut-off event [2024-11-10 14:36:24,087 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is not cut-off event [2024-11-10 14:36:24,087 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is not cut-off event [2024-11-10 14:36:24,145 INFO L124 PetriNetUnfolderBase]: 130/4221 cut-off events. [2024-11-10 14:36:24,145 INFO L125 PetriNetUnfolderBase]: For 572/614 co-relation queries the response was YES. [2024-11-10 14:36:24,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 4221 events. 130/4221 cut-off events. For 572/614 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 31450 event pairs, 22 based on Foata normal form. 0/4050 useless extension candidates. Maximal degree in co-relation 5553. Up to 124 conditions per place. [2024-11-10 14:36:24,208 INFO L140 encePairwiseOnDemand]: 632/634 looper letters, 9 selfloop transitions, 1 changer transitions 0/588 dead transitions. [2024-11-10 14:36:24,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 588 transitions, 1662 flow [2024-11-10 14:36:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1817 transitions. [2024-11-10 14:36:24,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.955310199789695 [2024-11-10 14:36:24,210 INFO L175 Difference]: Start difference. First operand has 614 places, 589 transitions, 1644 flow. Second operand 3 states and 1817 transitions. [2024-11-10 14:36:24,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 588 transitions, 1662 flow [2024-11-10 14:36:24,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 588 transitions, 1652 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:24,220 INFO L231 Difference]: Finished difference. Result has 610 places, 588 transitions, 1634 flow [2024-11-10 14:36:24,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1634, PETRI_PLACES=610, PETRI_TRANSITIONS=588} [2024-11-10 14:36:24,221 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 20 predicate places. [2024-11-10 14:36:24,221 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 588 transitions, 1634 flow [2024-11-10 14:36:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 605.0) internal successors, (1815), 3 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:24,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:24,222 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 14:36:24,222 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 410219727, now seen corresponding path program 1 times [2024-11-10 14:36:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060065541] [2024-11-10 14:36:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:24,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:24,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060065541] [2024-11-10 14:36:24,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060065541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:24,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:24,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:24,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467081243] [2024-11-10 14:36:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:24,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 634 [2024-11-10 14:36:24,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 588 transitions, 1634 flow. Second operand has 6 states, 6 states have (on average 582.1666666666666) internal successors, (3493), 6 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:24,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:24,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 634 [2024-11-10 14:36:24,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:25,575 INFO L124 PetriNetUnfolderBase]: 220/4137 cut-off events. [2024-11-10 14:36:25,575 INFO L125 PetriNetUnfolderBase]: For 787/816 co-relation queries the response was YES. [2024-11-10 14:36:25,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 4137 events. 220/4137 cut-off events. For 787/816 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32520 event pairs, 32 based on Foata normal form. 0/3993 useless extension candidates. Maximal degree in co-relation 5700. Up to 204 conditions per place. [2024-11-10 14:36:25,629 INFO L140 encePairwiseOnDemand]: 627/634 looper letters, 39 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2024-11-10 14:36:25,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 595 transitions, 1745 flow [2024-11-10 14:36:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3517 transitions. [2024-11-10 14:36:25,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.924553101997897 [2024-11-10 14:36:25,631 INFO L175 Difference]: Start difference. First operand has 610 places, 588 transitions, 1634 flow. Second operand 6 states and 3517 transitions. [2024-11-10 14:36:25,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 595 transitions, 1745 flow [2024-11-10 14:36:25,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 595 transitions, 1744 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:25,641 INFO L231 Difference]: Finished difference. Result has 612 places, 586 transitions, 1639 flow [2024-11-10 14:36:25,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1629, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1639, PETRI_PLACES=612, PETRI_TRANSITIONS=586} [2024-11-10 14:36:25,642 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 22 predicate places. [2024-11-10 14:36:25,642 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 586 transitions, 1639 flow [2024-11-10 14:36:25,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 582.1666666666666) internal successors, (3493), 6 states have internal predecessors, (3493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:25,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:25,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:25,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:36:25,643 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash -179293892, now seen corresponding path program 1 times [2024-11-10 14:36:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021232174] [2024-11-10 14:36:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:25,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021232174] [2024-11-10 14:36:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021232174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898498048] [2024-11-10 14:36:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:25,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:25,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:25,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 586 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:25,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:25,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:25,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:26,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1620] thread3EXIT-->L107-5: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][332], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), Black: 842#true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), 225#L107-5true, Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 861#true, Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 670#(<= ~n1~0 0), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), 867#true, Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 637#(= |#race~n2~0| 0), Black: 806#(<= ~n3~0 0), 625#(= |#race~n1~0| 0), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:26,134 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is not cut-off event [2024-11-10 14:36:26,134 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is not cut-off event [2024-11-10 14:36:26,134 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is not cut-off event [2024-11-10 14:36:26,134 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is not cut-off event [2024-11-10 14:36:26,194 INFO L124 PetriNetUnfolderBase]: 120/3737 cut-off events. [2024-11-10 14:36:26,194 INFO L125 PetriNetUnfolderBase]: For 486/552 co-relation queries the response was YES. [2024-11-10 14:36:26,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 3737 events. 120/3737 cut-off events. For 486/552 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 26377 event pairs, 27 based on Foata normal form. 0/3629 useless extension candidates. Maximal degree in co-relation 4982. Up to 133 conditions per place. [2024-11-10 14:36:26,248 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 11 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2024-11-10 14:36:26,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 584 transitions, 1659 flow [2024-11-10 14:36:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1811 transitions. [2024-11-10 14:36:26,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9521556256572029 [2024-11-10 14:36:26,249 INFO L175 Difference]: Start difference. First operand has 612 places, 586 transitions, 1639 flow. Second operand 3 states and 1811 transitions. [2024-11-10 14:36:26,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 584 transitions, 1659 flow [2024-11-10 14:36:26,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 584 transitions, 1649 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:36:26,258 INFO L231 Difference]: Finished difference. Result has 607 places, 584 transitions, 1627 flow [2024-11-10 14:36:26,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=607, PETRI_TRANSITIONS=584} [2024-11-10 14:36:26,259 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 17 predicate places. [2024-11-10 14:36:26,259 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 584 transitions, 1627 flow [2024-11-10 14:36:26,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:26,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:26,260 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:26,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:36:26,260 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 946470737, now seen corresponding path program 1 times [2024-11-10 14:36:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:26,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271723783] [2024-11-10 14:36:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:36:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271723783] [2024-11-10 14:36:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271723783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379067290] [2024-11-10 14:36:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:26,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:26,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 584 transitions, 1627 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:26,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:26,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:26,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:26,698 INFO L124 PetriNetUnfolderBase]: 120/3082 cut-off events. [2024-11-10 14:36:26,698 INFO L125 PetriNetUnfolderBase]: For 394/434 co-relation queries the response was YES. [2024-11-10 14:36:26,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 3082 events. 120/3082 cut-off events. For 394/434 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 20783 event pairs, 33 based on Foata normal form. 15/3023 useless extension candidates. Maximal degree in co-relation 4063. Up to 144 conditions per place. [2024-11-10 14:36:26,741 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 7 selfloop transitions, 0 changer transitions 25/582 dead transitions. [2024-11-10 14:36:26,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 582 transitions, 1645 flow [2024-11-10 14:36:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1810 transitions. [2024-11-10 14:36:26,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9516298633017876 [2024-11-10 14:36:26,742 INFO L175 Difference]: Start difference. First operand has 607 places, 584 transitions, 1627 flow. Second operand 3 states and 1810 transitions. [2024-11-10 14:36:26,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 582 transitions, 1645 flow [2024-11-10 14:36:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 582 transitions, 1644 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:26,750 INFO L231 Difference]: Finished difference. Result has 606 places, 557 transitions, 1507 flow [2024-11-10 14:36:26,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1507, PETRI_PLACES=606, PETRI_TRANSITIONS=557} [2024-11-10 14:36:26,751 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, 16 predicate places. [2024-11-10 14:36:26,751 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 557 transitions, 1507 flow [2024-11-10 14:36:26,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:26,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:26,752 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:26,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 14:36:26,752 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 830856006, now seen corresponding path program 1 times [2024-11-10 14:36:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133498229] [2024-11-10 14:36:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:26,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:26,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133498229] [2024-11-10 14:36:26,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133498229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:26,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:26,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380141543] [2024-11-10 14:36:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:26,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:26,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 634 [2024-11-10 14:36:26,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 557 transitions, 1507 flow. Second operand has 3 states, 3 states have (on average 601.6666666666666) internal successors, (1805), 3 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:26,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:26,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 634 [2024-11-10 14:36:26,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:27,301 INFO L124 PetriNetUnfolderBase]: 140/3576 cut-off events. [2024-11-10 14:36:27,302 INFO L125 PetriNetUnfolderBase]: For 379/399 co-relation queries the response was YES. [2024-11-10 14:36:27,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 3576 events. 140/3576 cut-off events. For 379/399 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23790 event pairs, 20 based on Foata normal form. 0/3485 useless extension candidates. Maximal degree in co-relation 4716. Up to 93 conditions per place. [2024-11-10 14:36:27,349 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 10 selfloop transitions, 2 changer transitions 12/558 dead transitions. [2024-11-10 14:36:27,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 558 transitions, 1535 flow [2024-11-10 14:36:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1813 transitions. [2024-11-10 14:36:27,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9532071503680336 [2024-11-10 14:36:27,351 INFO L175 Difference]: Start difference. First operand has 606 places, 557 transitions, 1507 flow. Second operand 3 states and 1813 transitions. [2024-11-10 14:36:27,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 558 transitions, 1535 flow [2024-11-10 14:36:27,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 558 transitions, 1523 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:27,360 INFO L231 Difference]: Finished difference. Result has 586 places, 544 transitions, 1415 flow [2024-11-10 14:36:27,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1415, PETRI_PLACES=586, PETRI_TRANSITIONS=544} [2024-11-10 14:36:27,361 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -4 predicate places. [2024-11-10 14:36:27,361 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 544 transitions, 1415 flow [2024-11-10 14:36:27,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.6666666666666) internal successors, (1805), 3 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:27,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:27,361 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 14:36:27,362 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:27,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:27,362 INFO L85 PathProgramCache]: Analyzing trace with hash 224054304, now seen corresponding path program 1 times [2024-11-10 14:36:27,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:27,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234650828] [2024-11-10 14:36:27,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234650828] [2024-11-10 14:36:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234650828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160240372] [2024-11-10 14:36:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:27,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:27,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:27,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:27,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 544 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:27,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:27,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:27,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:27,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1310] L51-12-->L51-11: Formula: (= |v_#race~a2~0_6| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_6|} AuxVars[] AssignedVars[#race~a2~0][381], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 876#true, 643#(= |#race~n3~0| 0), Black: 842#true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), 15#L65-19true, Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 658#true, Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 29#L102-1true, 559#L79-19true, Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), 660#(= |#race~a1~0| 0), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(<= ~n1~0 0), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), 637#(= |#race~n2~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 806#(<= ~n3~0 0), 625#(= |#race~n1~0| 0), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), 380#L51-11true, 873#true, Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 870#true, 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:27,798 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2024-11-10 14:36:27,798 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-10 14:36:27,799 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-10 14:36:27,799 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-10 14:36:27,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1621] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][355], [Black: 701#true, Black: 758#(<= ~n2~0 0), Black: 759#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 772#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 643#(= |#race~n3~0| 0), 876#true, Black: 842#true, 473#L105true, 665#true, Black: 655#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 658#true, Black: 711#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 724#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 710#(<= ~n1~0 0), Black: 781#(<= ~n3~0 0), Black: 789#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 787#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 795#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 782#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), 559#L79-19true, Black: 739#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 660#(= |#race~a1~0| 0), Black: 734#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 678#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 670#(<= ~n1~0 0), Black: 741#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 684#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 671#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 733#(<= ~n2~0 0), Black: 676#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 844#(= |#race~a3~0| 0), 637#(= |#race~n2~0| 0), Black: 807#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 806#(<= ~n3~0 0), 625#(= |#race~n1~0| 0), Black: 820#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 693#(not |thread3Thread1of1ForFork2_#t~short20#1|), 873#true, Black: 698#(not |thread2Thread1of1ForFork0_#t~short11#1|), 870#true, 703#(= |#race~a2~0| 0)]) [2024-11-10 14:36:27,839 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2024-11-10 14:36:27,839 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-10 14:36:27,839 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-10 14:36:27,839 INFO L297 olderBase$Statistics]: existing Event has 369 ancestors and is cut-off event [2024-11-10 14:36:27,845 INFO L124 PetriNetUnfolderBase]: 135/2919 cut-off events. [2024-11-10 14:36:27,845 INFO L125 PetriNetUnfolderBase]: For 276/299 co-relation queries the response was YES. [2024-11-10 14:36:27,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 2919 events. 135/2919 cut-off events. For 276/299 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18300 event pairs, 27 based on Foata normal form. 0/2834 useless extension candidates. Maximal degree in co-relation 3789. Up to 90 conditions per place. [2024-11-10 14:36:27,894 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 10 selfloop transitions, 2 changer transitions 11/545 dead transitions. [2024-11-10 14:36:27,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 545 transitions, 1443 flow [2024-11-10 14:36:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1810 transitions. [2024-11-10 14:36:27,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9516298633017876 [2024-11-10 14:36:27,896 INFO L175 Difference]: Start difference. First operand has 586 places, 544 transitions, 1415 flow. Second operand 3 states and 1810 transitions. [2024-11-10 14:36:27,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 545 transitions, 1443 flow [2024-11-10 14:36:27,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 545 transitions, 1397 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-11-10 14:36:27,903 INFO L231 Difference]: Finished difference. Result has 567 places, 532 transitions, 1293 flow [2024-11-10 14:36:27,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=567, PETRI_TRANSITIONS=532} [2024-11-10 14:36:27,904 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -23 predicate places. [2024-11-10 14:36:27,904 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 532 transitions, 1293 flow [2024-11-10 14:36:27,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.0) internal successors, (1803), 3 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:27,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:27,905 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:27,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 14:36:27,905 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2024-11-10 14:36:27,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1651167940, now seen corresponding path program 1 times [2024-11-10 14:36:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909591922] [2024-11-10 14:36:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:36:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909591922] [2024-11-10 14:36:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909591922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:27,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436247806] [2024-11-10 14:36:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:27,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:27,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 634 [2024-11-10 14:36:27,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 532 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:27,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:27,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 634 [2024-11-10 14:36:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:28,203 INFO L124 PetriNetUnfolderBase]: 107/1763 cut-off events. [2024-11-10 14:36:28,203 INFO L125 PetriNetUnfolderBase]: For 94/116 co-relation queries the response was YES. [2024-11-10 14:36:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 1763 events. 107/1763 cut-off events. For 94/116 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9728 event pairs, 21 based on Foata normal form. 1/1690 useless extension candidates. Maximal degree in co-relation 2207. Up to 71 conditions per place. [2024-11-10 14:36:28,227 INFO L140 encePairwiseOnDemand]: 631/634 looper letters, 0 selfloop transitions, 0 changer transitions 533/533 dead transitions. [2024-11-10 14:36:28,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 533 transitions, 1321 flow [2024-11-10 14:36:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1810 transitions. [2024-11-10 14:36:28,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9516298633017876 [2024-11-10 14:36:28,229 INFO L175 Difference]: Start difference. First operand has 567 places, 532 transitions, 1293 flow. Second operand 3 states and 1810 transitions. [2024-11-10 14:36:28,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 533 transitions, 1321 flow [2024-11-10 14:36:28,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 533 transitions, 1279 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-10 14:36:28,233 INFO L231 Difference]: Finished difference. Result has 548 places, 0 transitions, 0 flow [2024-11-10 14:36:28,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=634, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=548, PETRI_TRANSITIONS=0} [2024-11-10 14:36:28,234 INFO L277 CegarLoopForPetriNet]: 590 programPoint places, -42 predicate places. [2024-11-10 14:36:28,234 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 0 transitions, 0 flow [2024-11-10 14:36:28,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 601.3333333333334) internal successors, (1804), 3 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2024-11-10 14:36:28,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2024-11-10 14:36:28,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2024-11-10 14:36:28,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2024-11-10 14:36:28,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2024-11-10 14:36:28,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2024-11-10 14:36:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2024-11-10 14:36:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2024-11-10 14:36:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2024-11-10 14:36:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2024-11-10 14:36:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2024-11-10 14:36:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2024-11-10 14:36:28,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 14:36:28,248 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-10 14:36:28,255 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:36:28,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:36:28,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:36:28 BasicIcfg [2024-11-10 14:36:28,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:36:28,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:36:28,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:36:28,262 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:36:28,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:50" (3/4) ... [2024-11-10 14:36:28,263 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:36:28,266 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:36:28,266 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:36:28,266 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:36:28,274 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2024-11-10 14:36:28,275 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:36:28,275 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:36:28,275 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:36:28,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:36:28,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:36:28,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:36:28,362 INFO L158 Benchmark]: Toolchain (without parser) took 39561.66ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 124.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2024-11-10 14:36:28,362 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:36:28,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.17ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 109.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:36:28,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 195.0MB. Free memory was 109.3MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:36:28,363 INFO L158 Benchmark]: Boogie Preprocessor took 137.27ms. Allocated memory is still 195.0MB. Free memory was 104.9MB in the beginning and 162.0MB in the end (delta: -57.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-10 14:36:28,363 INFO L158 Benchmark]: IcfgBuilder took 811.70ms. Allocated memory is still 195.0MB. Free memory was 162.0MB in the beginning and 113.8MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-10 14:36:28,363 INFO L158 Benchmark]: TraceAbstraction took 38222.85ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 113.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2024-11-10 14:36:28,363 INFO L158 Benchmark]: Witness Printer took 100.17ms. Allocated memory is still 7.7GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:36:28,366 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.14ms. Allocated memory is still 195.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.17ms. Allocated memory is still 195.0MB. Free memory was 124.8MB in the beginning and 109.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 195.0MB. Free memory was 109.3MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 137.27ms. Allocated memory is still 195.0MB. Free memory was 104.9MB in the beginning and 162.0MB in the end (delta: -57.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * IcfgBuilder took 811.70ms. Allocated memory is still 195.0MB. Free memory was 162.0MB in the beginning and 113.8MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38222.85ms. Allocated memory was 195.0MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 113.8MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 100.17ms. Allocated memory is still 7.7GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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 7 procedures, 935 locations, 104 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: 38.0s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6672 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4353 mSDsluCounter, 6486 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5801 mSDsCounter, 1308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10697 IncrementalHoareTripleChecker+Invalid, 12005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1308 mSolverCounterUnsat, 685 mSDtfsCounter, 10697 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1669occurred in iteration=24, InterpolantAutomatonStates: 181, 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, 5.0s InterpolantComputationTime, 6417 NumberOfCodeBlocks, 6417 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6380 ConstructedInterpolants, 0 QuantifiedInterpolants, 8756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 46/46 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 - AllSpecificationsHoldResult: All specifications hold 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:36:28,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE